Step
*
2
1
of Lemma
padic-ring_wf
1. p : {2...}
2. ℤ(p) ∈ RngSig
3. ∀[x,y,z:p-adics(p)]. (x + y + z = x + y + z ∈ p-adics(p))
4. ∀[x:p-adics(p)]. ((x + 0(p) = x ∈ p-adics(p)) ∧ (0(p) + x = x ∈ p-adics(p)))
5. ∀[x:p-adics(p)]. ((x + -(x) = 0(p) ∈ p-adics(p)) ∧ (-(x) + x = 0(p) ∈ p-adics(p)))
6. ∀[x,y,z:p-adics(p)]. (x * y * z = x * y * z ∈ p-adics(p))
7. ∀[x:p-adics(p)]. ((x * 1(p) = x ∈ p-adics(p)) ∧ (1(p) * x = x ∈ p-adics(p)))
8. ∀[a,x,y:p-adics(p)]. ((a * x + y = a * x + a * y ∈ p-adics(p)) ∧ (x + y * a = x * a + y * a ∈ p-adics(p)))
9. ∀[x,y:p-adics(p)]. (x * y = y * x ∈ p-adics(p))
10. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-mul(p;a;b);pa-mul(p;a;b))
11. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-add(p;a;b);pa-add(p;a;b))
⊢ IsMonoid(padic(p);λu,v. pa-add(p;u;v);0(p))
BY
{ (RepeatFor 2 (D 0) THEN Reduce 0 THEN Auto) }
1
1. p : {2...}
2. ℤ(p) ∈ RngSig
3. ∀[x,y,z:p-adics(p)]. (x + y + z = x + y + z ∈ p-adics(p))
4. ∀[x:p-adics(p)]. ((x + 0(p) = x ∈ p-adics(p)) ∧ (0(p) + x = x ∈ p-adics(p)))
5. ∀[x:p-adics(p)]. ((x + -(x) = 0(p) ∈ p-adics(p)) ∧ (-(x) + x = 0(p) ∈ p-adics(p)))
6. ∀[x,y,z:p-adics(p)]. (x * y * z = x * y * z ∈ p-adics(p))
7. ∀[x:p-adics(p)]. ((x * 1(p) = x ∈ p-adics(p)) ∧ (1(p) * x = x ∈ p-adics(p)))
8. ∀[a,x,y:p-adics(p)]. ((a * x + y = a * x + a * y ∈ p-adics(p)) ∧ (x + y * a = x * a + y * a ∈ p-adics(p)))
9. ∀[x,y:p-adics(p)]. (x * y = y * x ∈ p-adics(p))
10. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-mul(p;a;b);pa-mul(p;a;b))
11. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-add(p;a;b);pa-add(p;a;b))
12. x : padic(p)
13. y : padic(p)
14. z : padic(p)
⊢ pa-add(p;x;pa-add(p;y;z)) = pa-add(p;pa-add(p;x;y);z) ∈ padic(p)
2
1. p : {2...}
2. ℤ(p) ∈ RngSig
3. ∀[x,y,z:p-adics(p)]. (x + y + z = x + y + z ∈ p-adics(p))
4. ∀[x:p-adics(p)]. ((x + 0(p) = x ∈ p-adics(p)) ∧ (0(p) + x = x ∈ p-adics(p)))
5. ∀[x:p-adics(p)]. ((x + -(x) = 0(p) ∈ p-adics(p)) ∧ (-(x) + x = 0(p) ∈ p-adics(p)))
6. ∀[x,y,z:p-adics(p)]. (x * y * z = x * y * z ∈ p-adics(p))
7. ∀[x:p-adics(p)]. ((x * 1(p) = x ∈ p-adics(p)) ∧ (1(p) * x = x ∈ p-adics(p)))
8. ∀[a,x,y:p-adics(p)]. ((a * x + y = a * x + a * y ∈ p-adics(p)) ∧ (x + y * a = x * a + y * a ∈ p-adics(p)))
9. ∀[x,y:p-adics(p)]. (x * y = y * x ∈ p-adics(p))
10. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-mul(p;a;b);pa-mul(p;a;b))
11. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-add(p;a;b);pa-add(p;a;b))
12. x : padic(p)
⊢ pa-add(p;x;0(p)) = x ∈ padic(p)
3
1. p : {2...}
2. ℤ(p) ∈ RngSig
3. ∀[x,y,z:p-adics(p)]. (x + y + z = x + y + z ∈ p-adics(p))
4. ∀[x:p-adics(p)]. ((x + 0(p) = x ∈ p-adics(p)) ∧ (0(p) + x = x ∈ p-adics(p)))
5. ∀[x:p-adics(p)]. ((x + -(x) = 0(p) ∈ p-adics(p)) ∧ (-(x) + x = 0(p) ∈ p-adics(p)))
6. ∀[x,y,z:p-adics(p)]. (x * y * z = x * y * z ∈ p-adics(p))
7. ∀[x:p-adics(p)]. ((x * 1(p) = x ∈ p-adics(p)) ∧ (1(p) * x = x ∈ p-adics(p)))
8. ∀[a,x,y:p-adics(p)]. ((a * x + y = a * x + a * y ∈ p-adics(p)) ∧ (x + y * a = x * a + y * a ∈ p-adics(p)))
9. ∀[x,y:p-adics(p)]. (x * y = y * x ∈ p-adics(p))
10. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-mul(p;a;b);pa-mul(p;a;b))
11. ∀a,b:basic-padic(p). bpa-equiv(p;bpa-add(p;a;b);pa-add(p;a;b))
12. x : padic(p)
13. pa-add(p;x;0(p)) = x ∈ padic(p)
⊢ pa-add(p;0(p);x) = x ∈ padic(p)
Latex:
Latex:
1. p : \{2...\}
2. \mBbbZ{}(p) \mmember{} RngSig
3. \mforall{}[x,y,z:p-adics(p)]. (x + y + z = x + y + z)
4. \mforall{}[x:p-adics(p)]. ((x + 0(p) = x) \mwedge{} (0(p) + x = x))
5. \mforall{}[x:p-adics(p)]. ((x + -(x) = 0(p)) \mwedge{} (-(x) + x = 0(p)))
6. \mforall{}[x,y,z:p-adics(p)]. (x * y * z = x * y * z)
7. \mforall{}[x:p-adics(p)]. ((x * 1(p) = x) \mwedge{} (1(p) * x = x))
8. \mforall{}[a,x,y:p-adics(p)]. ((a * x + y = a * x + a * y) \mwedge{} (x + y * a = x * a + y * a))
9. \mforall{}[x,y:p-adics(p)]. (x * y = y * x)
10. \mforall{}a,b:basic-padic(p). bpa-equiv(p;bpa-mul(p;a;b);pa-mul(p;a;b))
11. \mforall{}a,b:basic-padic(p). bpa-equiv(p;bpa-add(p;a;b);pa-add(p;a;b))
\mvdash{} IsMonoid(padic(p);\mlambda{}u,v. pa-add(p;u;v);0(p))
By
Latex:
(RepeatFor 2 (D 0) THEN Reduce 0 THEN Auto)
Home
Index