lemma
proved
neg
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.RecogSpec.Core on GitHub at line 82.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
sub_eq_add -
J_at_phi -
PhiInt -
PhiInt -
canonicalPhiRingObj -
PhiRingHom -
PhiRingObj -
duhamelRemainderOfGalerkin_integratingFactor -
tendsto_duhamelKernelIntegral_of_dominated_convergence -
encodeClause -
clauseUnit -
clauseUnit_correct -
known_lit_false'' -
valueOfLit -
evalLit -
Lit -
mentionsVarLit -
deriv_alphaInv_of_gap -
logarithmic_derivative_constant -
dAlembert_to_ODE_general -
ode_cos_uniqueness -
dAlembert_to_ODE_general -
ode_cos_uniqueness -
dAlembert_to_ODE_general_theorem -
dAlembert_to_ODE_theorem -
dAlembert_to_ODE_theorem -
Jcost_log_second_deriv_normalized -
neg -
ode_cos_unit_uniqueness -
toComplex_neg -
even_function_deriv_zero -
separable_forces_flat_ode -
Gspher_satisfies_spherical -
dalembert_deriv_ode -
neg -
neg -
C_RS_minus_C_classical_tendsto_zero -
ode_cos_uniqueness_contdiff -
bet1_boundaryTerm_integrable_of_L2_mul_r -
operatorPairing_of_decayFull
formal source
79 PhiClosed φ (x - y) :=
80 (phiSubfield φ).sub_mem hx hy
81
82lemma neg (hx : PhiClosed φ x) : PhiClosed φ (-x) :=
83 (phiSubfield φ).neg_mem hx
84
85lemma mul (hx : PhiClosed φ x) (hy : PhiClosed φ y) :
86 PhiClosed φ (x * y) :=
87 (phiSubfield φ).mul_mem hx hy
88
89lemma inv (hx : PhiClosed φ x) : PhiClosed φ x⁻¹ :=
90 (phiSubfield φ).inv_mem hx
91
92lemma div (hx : PhiClosed φ x) (hy : PhiClosed φ y) :
93 PhiClosed φ (x / y) :=
94 (phiSubfield φ).div_mem hx hy
95
96lemma pow (hx : PhiClosed φ x) (n : ℕ) : PhiClosed φ (x ^ n) := by
97 simpa using (phiSubfield φ).pow_mem hx n
98
99lemma pow_self (φ : ℝ) (n : ℕ) : PhiClosed φ (φ ^ n) :=
100 pow (self φ) n
101
102lemma inv_self (φ : ℝ) : PhiClosed φ (φ⁻¹) :=
103 inv (self φ)
104
105lemma inv_pow_self (φ : ℝ) (n : ℕ) : PhiClosed φ ((φ ^ n)⁻¹) :=
106 inv (pow_self φ n)
107
108lemma of_nat (φ : ℝ) (n : ℕ) : PhiClosed φ (n : ℝ) := by
109 simpa using of_rat φ n
110
111lemma half (φ : ℝ) : PhiClosed φ (1 / (2 : ℝ)) := by
112 have htwo : PhiClosed φ ((2 : ℚ) : ℝ) := of_rat φ 2