MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfod2 Structured version   Visualization version   GIF version

Theorem dfod2 17902
Description: An alternative definition of the order of a group element is as the cardinality of the cyclic subgroup generated by the element. (Contributed by Mario Carneiro, 14-Jan-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
Hypotheses
Ref Expression
odf1.1 𝑋 = (Base‘𝐺)
odf1.2 𝑂 = (od‘𝐺)
odf1.3 · = (.g𝐺)
odf1.4 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴))
Assertion
Ref Expression
dfod2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝑂𝐴) = if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐺   𝑥,𝑂   𝑥, ·   𝑥,𝑋
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem dfod2
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fzfid 12712 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (0...((𝑂𝐴) − 1)) ∈ Fin)
2 odf1.1 . . . . . . . . . . . . 13 𝑋 = (Base‘𝐺)
3 odf1.3 . . . . . . . . . . . . 13 · = (.g𝐺)
42, 3mulgcl 17480 . . . . . . . . . . . 12 ((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ ∧ 𝐴𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
543expa 1262 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ) ∧ 𝐴𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
65an32s 845 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝐴) ∈ 𝑋)
76adantlr 750 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝐴) ∈ 𝑋)
8 odf1.4 . . . . . . . . 9 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴))
97, 8fmptd 6340 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → 𝐹:ℤ⟶𝑋)
10 frn 6010 . . . . . . . 8 (𝐹:ℤ⟶𝑋 → ran 𝐹𝑋)
11 fvex 6158 . . . . . . . . . 10 (Base‘𝐺) ∈ V
122, 11eqeltri 2694 . . . . . . . . 9 𝑋 ∈ V
1312ssex 4762 . . . . . . . 8 (ran 𝐹𝑋 → ran 𝐹 ∈ V)
149, 10, 133syl 18 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ran 𝐹 ∈ V)
15 elfzelz 12284 . . . . . . . . . . 11 (𝑦 ∈ (0...((𝑂𝐴) − 1)) → 𝑦 ∈ ℤ)
1615adantl 482 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝑦 ∈ ℤ)
17 ovex 6632 . . . . . . . . . 10 (𝑦 · 𝐴) ∈ V
18 oveq1 6611 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝑥 · 𝐴) = (𝑦 · 𝐴))
198, 18elrnmpt1s 5333 . . . . . . . . . 10 ((𝑦 ∈ ℤ ∧ (𝑦 · 𝐴) ∈ V) → (𝑦 · 𝐴) ∈ ran 𝐹)
2016, 17, 19sylancl 693 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → (𝑦 · 𝐴) ∈ ran 𝐹)
2120ralrimiva 2960 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ∀𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑦 · 𝐴) ∈ ran 𝐹)
22 zmodfz 12632 . . . . . . . . . . . . 13 ((𝑥 ∈ ℤ ∧ (𝑂𝐴) ∈ ℕ) → (𝑥 mod (𝑂𝐴)) ∈ (0...((𝑂𝐴) − 1)))
2322ancoms 469 . . . . . . . . . . . 12 (((𝑂𝐴) ∈ ℕ ∧ 𝑥 ∈ ℤ) → (𝑥 mod (𝑂𝐴)) ∈ (0...((𝑂𝐴) − 1)))
2423adantll 749 . . . . . . . . . . 11 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) → (𝑥 mod (𝑂𝐴)) ∈ (0...((𝑂𝐴) − 1)))
25 simpllr 798 . . . . . . . . . . . . . 14 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → (𝑂𝐴) ∈ ℕ)
26 simplr 791 . . . . . . . . . . . . . 14 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝑥 ∈ ℤ)
2715adantl 482 . . . . . . . . . . . . . 14 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝑦 ∈ ℤ)
28 moddvds 14915 . . . . . . . . . . . . . 14 (((𝑂𝐴) ∈ ℕ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑥 mod (𝑂𝐴)) = (𝑦 mod (𝑂𝐴)) ↔ (𝑂𝐴) ∥ (𝑥𝑦)))
2925, 26, 27, 28syl3anc 1323 . . . . . . . . . . . . 13 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → ((𝑥 mod (𝑂𝐴)) = (𝑦 mod (𝑂𝐴)) ↔ (𝑂𝐴) ∥ (𝑥𝑦)))
3027zred 11426 . . . . . . . . . . . . . . . 16 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝑦 ∈ ℝ)
3125nnrpd 11814 . . . . . . . . . . . . . . . 16 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → (𝑂𝐴) ∈ ℝ+)
32 0z 11332 . . . . . . . . . . . . . . . . . . 19 0 ∈ ℤ
33 nnz 11343 . . . . . . . . . . . . . . . . . . . . 21 ((𝑂𝐴) ∈ ℕ → (𝑂𝐴) ∈ ℤ)
3433adantl 482 . . . . . . . . . . . . . . . . . . . 20 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (𝑂𝐴) ∈ ℤ)
3534adantr 481 . . . . . . . . . . . . . . . . . . 19 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) → (𝑂𝐴) ∈ ℤ)
36 elfzm11 12352 . . . . . . . . . . . . . . . . . . 19 ((0 ∈ ℤ ∧ (𝑂𝐴) ∈ ℤ) → (𝑦 ∈ (0...((𝑂𝐴) − 1)) ↔ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦𝑦 < (𝑂𝐴))))
3732, 35, 36sylancr 694 . . . . . . . . . . . . . . . . . 18 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) → (𝑦 ∈ (0...((𝑂𝐴) − 1)) ↔ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦𝑦 < (𝑂𝐴))))
3837biimpa 501 . . . . . . . . . . . . . . . . 17 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦𝑦 < (𝑂𝐴)))
3938simp2d 1072 . . . . . . . . . . . . . . . 16 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 0 ≤ 𝑦)
4038simp3d 1073 . . . . . . . . . . . . . . . 16 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝑦 < (𝑂𝐴))
41 modid 12635 . . . . . . . . . . . . . . . 16 (((𝑦 ∈ ℝ ∧ (𝑂𝐴) ∈ ℝ+) ∧ (0 ≤ 𝑦𝑦 < (𝑂𝐴))) → (𝑦 mod (𝑂𝐴)) = 𝑦)
4230, 31, 39, 40, 41syl22anc 1324 . . . . . . . . . . . . . . 15 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → (𝑦 mod (𝑂𝐴)) = 𝑦)
4342eqeq2d 2631 . . . . . . . . . . . . . 14 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → ((𝑥 mod (𝑂𝐴)) = (𝑦 mod (𝑂𝐴)) ↔ (𝑥 mod (𝑂𝐴)) = 𝑦))
44 eqcom 2628 . . . . . . . . . . . . . 14 ((𝑥 mod (𝑂𝐴)) = 𝑦𝑦 = (𝑥 mod (𝑂𝐴)))
4543, 44syl6bb 276 . . . . . . . . . . . . 13 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → ((𝑥 mod (𝑂𝐴)) = (𝑦 mod (𝑂𝐴)) ↔ 𝑦 = (𝑥 mod (𝑂𝐴))))
46 simp-4l 805 . . . . . . . . . . . . . 14 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝐺 ∈ Grp)
47 simp-4r 806 . . . . . . . . . . . . . 14 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → 𝐴𝑋)
48 odf1.2 . . . . . . . . . . . . . . 15 𝑂 = (od‘𝐺)
49 eqid 2621 . . . . . . . . . . . . . . 15 (0g𝐺) = (0g𝐺)
502, 48, 3, 49odcong 17889 . . . . . . . . . . . . . 14 ((𝐺 ∈ Grp ∧ 𝐴𝑋 ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑂𝐴) ∥ (𝑥𝑦) ↔ (𝑥 · 𝐴) = (𝑦 · 𝐴)))
5146, 47, 26, 27, 50syl112anc 1327 . . . . . . . . . . . . 13 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → ((𝑂𝐴) ∥ (𝑥𝑦) ↔ (𝑥 · 𝐴) = (𝑦 · 𝐴)))
5229, 45, 513bitr3rd 299 . . . . . . . . . . . 12 (((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...((𝑂𝐴) − 1))) → ((𝑥 · 𝐴) = (𝑦 · 𝐴) ↔ 𝑦 = (𝑥 mod (𝑂𝐴))))
5352ralrimiva 2960 . . . . . . . . . . 11 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) → ∀𝑦 ∈ (0...((𝑂𝐴) − 1))((𝑥 · 𝐴) = (𝑦 · 𝐴) ↔ 𝑦 = (𝑥 mod (𝑂𝐴))))
54 reu6i 3379 . . . . . . . . . . 11 (((𝑥 mod (𝑂𝐴)) ∈ (0...((𝑂𝐴) − 1)) ∧ ∀𝑦 ∈ (0...((𝑂𝐴) − 1))((𝑥 · 𝐴) = (𝑦 · 𝐴) ↔ 𝑦 = (𝑥 mod (𝑂𝐴)))) → ∃!𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑥 · 𝐴) = (𝑦 · 𝐴))
5524, 53, 54syl2anc 692 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) ∧ 𝑥 ∈ ℤ) → ∃!𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑥 · 𝐴) = (𝑦 · 𝐴))
5655ralrimiva 2960 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ∀𝑥 ∈ ℤ ∃!𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑥 · 𝐴) = (𝑦 · 𝐴))
57 ovex 6632 . . . . . . . . . . 11 (𝑥 · 𝐴) ∈ V
5857rgenw 2919 . . . . . . . . . 10 𝑥 ∈ ℤ (𝑥 · 𝐴) ∈ V
59 eqeq1 2625 . . . . . . . . . . . 12 (𝑧 = (𝑥 · 𝐴) → (𝑧 = (𝑦 · 𝐴) ↔ (𝑥 · 𝐴) = (𝑦 · 𝐴)))
6059reubidv 3115 . . . . . . . . . . 11 (𝑧 = (𝑥 · 𝐴) → (∃!𝑦 ∈ (0...((𝑂𝐴) − 1))𝑧 = (𝑦 · 𝐴) ↔ ∃!𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑥 · 𝐴) = (𝑦 · 𝐴)))
618, 60ralrnmpt 6324 . . . . . . . . . 10 (∀𝑥 ∈ ℤ (𝑥 · 𝐴) ∈ V → (∀𝑧 ∈ ran 𝐹∃!𝑦 ∈ (0...((𝑂𝐴) − 1))𝑧 = (𝑦 · 𝐴) ↔ ∀𝑥 ∈ ℤ ∃!𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑥 · 𝐴) = (𝑦 · 𝐴)))
6258, 61ax-mp 5 . . . . . . . . 9 (∀𝑧 ∈ ran 𝐹∃!𝑦 ∈ (0...((𝑂𝐴) − 1))𝑧 = (𝑦 · 𝐴) ↔ ∀𝑥 ∈ ℤ ∃!𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑥 · 𝐴) = (𝑦 · 𝐴))
6356, 62sylibr 224 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ∀𝑧 ∈ ran 𝐹∃!𝑦 ∈ (0...((𝑂𝐴) − 1))𝑧 = (𝑦 · 𝐴))
64 eqid 2621 . . . . . . . . 9 (𝑦 ∈ (0...((𝑂𝐴) − 1)) ↦ (𝑦 · 𝐴)) = (𝑦 ∈ (0...((𝑂𝐴) − 1)) ↦ (𝑦 · 𝐴))
6564f1ompt 6338 . . . . . . . 8 ((𝑦 ∈ (0...((𝑂𝐴) − 1)) ↦ (𝑦 · 𝐴)):(0...((𝑂𝐴) − 1))–1-1-onto→ran 𝐹 ↔ (∀𝑦 ∈ (0...((𝑂𝐴) − 1))(𝑦 · 𝐴) ∈ ran 𝐹 ∧ ∀𝑧 ∈ ran 𝐹∃!𝑦 ∈ (0...((𝑂𝐴) − 1))𝑧 = (𝑦 · 𝐴)))
6621, 63, 65sylanbrc 697 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (𝑦 ∈ (0...((𝑂𝐴) − 1)) ↦ (𝑦 · 𝐴)):(0...((𝑂𝐴) − 1))–1-1-onto→ran 𝐹)
67 f1oen2g 7916 . . . . . . 7 (((0...((𝑂𝐴) − 1)) ∈ Fin ∧ ran 𝐹 ∈ V ∧ (𝑦 ∈ (0...((𝑂𝐴) − 1)) ↦ (𝑦 · 𝐴)):(0...((𝑂𝐴) − 1))–1-1-onto→ran 𝐹) → (0...((𝑂𝐴) − 1)) ≈ ran 𝐹)
681, 14, 66, 67syl3anc 1323 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (0...((𝑂𝐴) − 1)) ≈ ran 𝐹)
69 enfi 8120 . . . . . 6 ((0...((𝑂𝐴) − 1)) ≈ ran 𝐹 → ((0...((𝑂𝐴) − 1)) ∈ Fin ↔ ran 𝐹 ∈ Fin))
7068, 69syl 17 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ((0...((𝑂𝐴) − 1)) ∈ Fin ↔ ran 𝐹 ∈ Fin))
711, 70mpbid 222 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ran 𝐹 ∈ Fin)
7271iftrued 4066 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0) = (#‘ran 𝐹))
73 fz01en 12311 . . . . . 6 ((𝑂𝐴) ∈ ℤ → (0...((𝑂𝐴) − 1)) ≈ (1...(𝑂𝐴)))
74 ensym 7949 . . . . . 6 ((0...((𝑂𝐴) − 1)) ≈ (1...(𝑂𝐴)) → (1...(𝑂𝐴)) ≈ (0...((𝑂𝐴) − 1)))
7534, 73, 743syl 18 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (1...(𝑂𝐴)) ≈ (0...((𝑂𝐴) − 1)))
76 entr 7952 . . . . 5 (((1...(𝑂𝐴)) ≈ (0...((𝑂𝐴) − 1)) ∧ (0...((𝑂𝐴) − 1)) ≈ ran 𝐹) → (1...(𝑂𝐴)) ≈ ran 𝐹)
7775, 68, 76syl2anc 692 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (1...(𝑂𝐴)) ≈ ran 𝐹)
78 fzfid 12712 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (1...(𝑂𝐴)) ∈ Fin)
79 hashen 13075 . . . . 5 (((1...(𝑂𝐴)) ∈ Fin ∧ ran 𝐹 ∈ Fin) → ((#‘(1...(𝑂𝐴))) = (#‘ran 𝐹) ↔ (1...(𝑂𝐴)) ≈ ran 𝐹))
8078, 71, 79syl2anc 692 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → ((#‘(1...(𝑂𝐴))) = (#‘ran 𝐹) ↔ (1...(𝑂𝐴)) ≈ ran 𝐹))
8177, 80mpbird 247 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (#‘(1...(𝑂𝐴))) = (#‘ran 𝐹))
82 nnnn0 11243 . . . . 5 ((𝑂𝐴) ∈ ℕ → (𝑂𝐴) ∈ ℕ0)
8382adantl 482 . . . 4 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (𝑂𝐴) ∈ ℕ0)
84 hashfz1 13074 . . . 4 ((𝑂𝐴) ∈ ℕ0 → (#‘(1...(𝑂𝐴))) = (𝑂𝐴))
8583, 84syl 17 . . 3 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (#‘(1...(𝑂𝐴))) = (𝑂𝐴))
8672, 81, 853eqtr2rd 2662 . 2 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) ∈ ℕ) → (𝑂𝐴) = if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0))
87 simp3 1061 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋 ∧ (𝑂𝐴) = 0) → (𝑂𝐴) = 0)
882, 48, 3, 8odinf 17901 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐴𝑋 ∧ (𝑂𝐴) = 0) → ¬ ran 𝐹 ∈ Fin)
8988iffalsed 4069 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋 ∧ (𝑂𝐴) = 0) → if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0) = 0)
9087, 89eqtr4d 2658 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋 ∧ (𝑂𝐴) = 0) → (𝑂𝐴) = if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0))
91903expa 1262 . 2 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑂𝐴) = 0) → (𝑂𝐴) = if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0))
922, 48odcl 17876 . . . 4 (𝐴𝑋 → (𝑂𝐴) ∈ ℕ0)
9392adantl 482 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝑂𝐴) ∈ ℕ0)
94 elnn0 11238 . . 3 ((𝑂𝐴) ∈ ℕ0 ↔ ((𝑂𝐴) ∈ ℕ ∨ (𝑂𝐴) = 0))
9593, 94sylib 208 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ((𝑂𝐴) ∈ ℕ ∨ (𝑂𝐴) = 0))
9686, 91, 95mpjaodan 826 1 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝑂𝐴) = if(ran 𝐹 ∈ Fin, (#‘ran 𝐹), 0))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wo 383  wa 384  w3a 1036   = wceq 1480  wcel 1987  wral 2907  ∃!wreu 2909  Vcvv 3186  wss 3555  ifcif 4058   class class class wbr 4613  cmpt 4673  ran crn 5075  wf 5843  1-1-ontowf1o 5846  cfv 5847  (class class class)co 6604  cen 7896  Fincfn 7899  cr 9879  0cc0 9880  1c1 9881   < clt 10018  cle 10019  cmin 10210  cn 10964  0cn0 11236  cz 11321  +crp 11776  ...cfz 12268   mod cmo 12608  #chash 13057  cdvds 14907  Basecbs 15781  0gc0g 16021  Grpcgrp 17343  .gcmg 17461  odcod 17865
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902  ax-inf2 8482  ax-cnex 9936  ax-resscn 9937  ax-1cn 9938  ax-icn 9939  ax-addcl 9940  ax-addrcl 9941  ax-mulcl 9942  ax-mulrcl 9943  ax-mulcom 9944  ax-addass 9945  ax-mulass 9946  ax-distr 9947  ax-i2m1 9948  ax-1ne0 9949  ax-1rid 9950  ax-rnegex 9951  ax-rrecex 9952  ax-cnre 9953  ax-pre-lttri 9954  ax-pre-lttrn 9955  ax-pre-ltadd 9956  ax-pre-mulgt0 9957  ax-pre-sup 9958
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-se 5034  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-isom 5856  df-riota 6565  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-om 7013  df-1st 7113  df-2nd 7114  df-wrecs 7352  df-recs 7413  df-rdg 7451  df-1o 7505  df-oadd 7509  df-omul 7510  df-er 7687  df-map 7804  df-en 7900  df-dom 7901  df-sdom 7902  df-fin 7903  df-sup 8292  df-inf 8293  df-oi 8359  df-card 8709  df-acn 8712  df-pnf 10020  df-mnf 10021  df-xr 10022  df-ltxr 10023  df-le 10024  df-sub 10212  df-neg 10213  df-div 10629  df-nn 10965  df-2 11023  df-3 11024  df-n0 11237  df-z 11322  df-uz 11632  df-rp 11777  df-fz 12269  df-fl 12533  df-mod 12609  df-seq 12742  df-exp 12801  df-hash 13058  df-cj 13773  df-re 13774  df-im 13775  df-sqrt 13909  df-abs 13910  df-dvds 14908  df-0g 16023  df-mgm 17163  df-sgrp 17205  df-mnd 17216  df-grp 17346  df-minusg 17347  df-sbg 17348  df-mulg 17462  df-od 17869
This theorem is referenced by:  oddvds2  17904  cyggenod  18207  cyggenod2  18208
  Copyright terms: Public domain W3C validator