Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  idomsubgmo Structured version   Visualization version   GIF version

Theorem idomsubgmo 43502
Description: The units of an integral domain have at most one subgroup of any single finite cardinality. (Contributed by Stefan O'Rear, 12-Sep-2015.) (Revised by NM, 17-Jun-2017.)
Hypothesis
Ref Expression
idomsubgmo.g 𝐺 = ((mulGrp‘𝑅) ↾s (Unit‘𝑅))
Assertion
Ref Expression
idomsubgmo ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → ∃*𝑦 ∈ (SubGrp‘𝐺)(♯‘𝑦) = 𝑁)
Distinct variable groups:   𝑦,𝐺   𝑦,𝑁   𝑦,𝑅

Proof of Theorem idomsubgmo
Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6848 . . . . . . . . 9 (Base‘𝐺) ∈ V
21rabex 5285 . . . . . . . 8 {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V
3 simp2l 1201 . . . . . . . . . . 11 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑦 ∈ (SubGrp‘𝐺))
4 eqid 2737 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
54subgss 19061 . . . . . . . . . . 11 (𝑦 ∈ (SubGrp‘𝐺) → 𝑦 ⊆ (Base‘𝐺))
63, 5syl 17 . . . . . . . . . 10 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑦 ⊆ (Base‘𝐺))
7 simpl2l 1228 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → 𝑦 ∈ (SubGrp‘𝐺))
8 simp3l 1203 . . . . . . . . . . . . . . 15 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘𝑦) = 𝑁)
9 simp1r 1200 . . . . . . . . . . . . . . . 16 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑁 ∈ ℕ)
109nnnn0d 12466 . . . . . . . . . . . . . . 15 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑁 ∈ ℕ0)
118, 10eqeltrd 2837 . . . . . . . . . . . . . 14 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘𝑦) ∈ ℕ0)
12 vex 3445 . . . . . . . . . . . . . . 15 𝑦 ∈ V
13 hashclb 14285 . . . . . . . . . . . . . . 15 (𝑦 ∈ V → (𝑦 ∈ Fin ↔ (♯‘𝑦) ∈ ℕ0))
1412, 13ax-mp 5 . . . . . . . . . . . . . 14 (𝑦 ∈ Fin ↔ (♯‘𝑦) ∈ ℕ0)
1511, 14sylibr 234 . . . . . . . . . . . . 13 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑦 ∈ Fin)
1615adantr 480 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → 𝑦 ∈ Fin)
17 simpr 484 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → 𝑧𝑦)
18 eqid 2737 . . . . . . . . . . . . 13 (od‘𝐺) = (od‘𝐺)
1918odsubdvds 19504 . . . . . . . . . . . 12 ((𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑦 ∈ Fin ∧ 𝑧𝑦) → ((od‘𝐺)‘𝑧) ∥ (♯‘𝑦))
207, 16, 17, 19syl3anc 1374 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → ((od‘𝐺)‘𝑧) ∥ (♯‘𝑦))
218adantr 480 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → (♯‘𝑦) = 𝑁)
2220, 21breqtrd 5125 . . . . . . . . . 10 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → ((od‘𝐺)‘𝑧) ∥ 𝑁)
236, 22ssrabdv 4026 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑦 ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
24 simp2r 1202 . . . . . . . . . . 11 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑥 ∈ (SubGrp‘𝐺))
254subgss 19061 . . . . . . . . . . 11 (𝑥 ∈ (SubGrp‘𝐺) → 𝑥 ⊆ (Base‘𝐺))
2624, 25syl 17 . . . . . . . . . 10 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑥 ⊆ (Base‘𝐺))
27 simpl2r 1229 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → 𝑥 ∈ (SubGrp‘𝐺))
28 simp3r 1204 . . . . . . . . . . . . . . 15 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘𝑥) = 𝑁)
2928, 10eqeltrd 2837 . . . . . . . . . . . . . 14 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘𝑥) ∈ ℕ0)
30 vex 3445 . . . . . . . . . . . . . . 15 𝑥 ∈ V
31 hashclb 14285 . . . . . . . . . . . . . . 15 (𝑥 ∈ V → (𝑥 ∈ Fin ↔ (♯‘𝑥) ∈ ℕ0))
3230, 31ax-mp 5 . . . . . . . . . . . . . 14 (𝑥 ∈ Fin ↔ (♯‘𝑥) ∈ ℕ0)
3329, 32sylibr 234 . . . . . . . . . . . . 13 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑥 ∈ Fin)
3433adantr 480 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → 𝑥 ∈ Fin)
35 simpr 484 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → 𝑧𝑥)
3618odsubdvds 19504 . . . . . . . . . . . 12 ((𝑥 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ Fin ∧ 𝑧𝑥) → ((od‘𝐺)‘𝑧) ∥ (♯‘𝑥))
3727, 34, 35, 36syl3anc 1374 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → ((od‘𝐺)‘𝑧) ∥ (♯‘𝑥))
3828adantr 480 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → (♯‘𝑥) = 𝑁)
3937, 38breqtrd 5125 . . . . . . . . . 10 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → ((od‘𝐺)‘𝑧) ∥ 𝑁)
4026, 39ssrabdv 4026 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑥 ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
4123, 40unssd 4145 . . . . . . . 8 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (𝑦𝑥) ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
42 ssdomg 8941 . . . . . . . 8 ({𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V → ((𝑦𝑥) ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} → (𝑦𝑥) ≼ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}))
432, 41, 42mpsyl 68 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (𝑦𝑥) ≼ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
44 idomsubgmo.g . . . . . . . . . . 11 𝐺 = ((mulGrp‘𝑅) ↾s (Unit‘𝑅))
4544, 4, 18idomodle 43500 . . . . . . . . . 10 ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → (♯‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ 𝑁)
46453ad2ant1 1134 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ 𝑁)
4746, 8breqtrrd 5127 . . . . . . . 8 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (♯‘𝑦))
482a1i 11 . . . . . . . . . 10 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V)
49 hashbnd 14263 . . . . . . . . . 10 (({𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V ∧ (♯‘𝑦) ∈ ℕ0 ∧ (♯‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (♯‘𝑦)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ Fin)
5048, 11, 47, 49syl3anc 1374 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ Fin)
51 hashdom 14306 . . . . . . . . 9 (({𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ Fin ∧ 𝑦 ∈ V) → ((♯‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (♯‘𝑦) ↔ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦))
5250, 12, 51sylancl 587 . . . . . . . 8 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → ((♯‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (♯‘𝑦) ↔ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦))
5347, 52mpbid 232 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦)
54 domtr 8948 . . . . . . 7 (((𝑦𝑥) ≼ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∧ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦) → (𝑦𝑥) ≼ 𝑦)
5543, 53, 54syl2anc 585 . . . . . 6 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (𝑦𝑥) ≼ 𝑦)
5612, 30unex 7691 . . . . . . 7 (𝑦𝑥) ∈ V
57 ssun1 4131 . . . . . . 7 𝑦 ⊆ (𝑦𝑥)
58 ssdomg 8941 . . . . . . 7 ((𝑦𝑥) ∈ V → (𝑦 ⊆ (𝑦𝑥) → 𝑦 ≼ (𝑦𝑥)))
5956, 57, 58mp2 9 . . . . . 6 𝑦 ≼ (𝑦𝑥)
60 sbth 9029 . . . . . 6 (((𝑦𝑥) ≼ 𝑦𝑦 ≼ (𝑦𝑥)) → (𝑦𝑥) ≈ 𝑦)
6155, 59, 60sylancl 587 . . . . 5 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (𝑦𝑥) ≈ 𝑦)
628, 28eqtr4d 2775 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → (♯‘𝑦) = (♯‘𝑥))
63 hashen 14274 . . . . . . . 8 ((𝑦 ∈ Fin ∧ 𝑥 ∈ Fin) → ((♯‘𝑦) = (♯‘𝑥) ↔ 𝑦𝑥))
6415, 33, 63syl2anc 585 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → ((♯‘𝑦) = (♯‘𝑥) ↔ 𝑦𝑥))
6562, 64mpbid 232 . . . . . 6 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑦𝑥)
66 fiuneneq 43501 . . . . . 6 ((𝑦𝑥𝑦 ∈ Fin) → ((𝑦𝑥) ≈ 𝑦𝑦 = 𝑥))
6765, 15, 66syl2anc 585 . . . . 5 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → ((𝑦𝑥) ≈ 𝑦𝑦 = 𝑥))
6861, 67mpbid 232 . . . 4 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁)) → 𝑦 = 𝑥)
69683expia 1122 . . 3 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺))) → (((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁) → 𝑦 = 𝑥))
7069ralrimivva 3180 . 2 ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → ∀𝑦 ∈ (SubGrp‘𝐺)∀𝑥 ∈ (SubGrp‘𝐺)(((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁) → 𝑦 = 𝑥))
71 fveqeq2 6844 . . 3 (𝑦 = 𝑥 → ((♯‘𝑦) = 𝑁 ↔ (♯‘𝑥) = 𝑁))
7271rmo4 3689 . 2 (∃*𝑦 ∈ (SubGrp‘𝐺)(♯‘𝑦) = 𝑁 ↔ ∀𝑦 ∈ (SubGrp‘𝐺)∀𝑥 ∈ (SubGrp‘𝐺)(((♯‘𝑦) = 𝑁 ∧ (♯‘𝑥) = 𝑁) → 𝑦 = 𝑥))
7370, 72sylibr 234 1 ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → ∃*𝑦 ∈ (SubGrp‘𝐺)(♯‘𝑦) = 𝑁)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  ∃*wrmo 3350  {crab 3400  Vcvv 3441  cun 3900  wss 3902   class class class wbr 5099  cfv 6493  (class class class)co 7360  cen 8884  cdom 8885  Fincfn 8887  cle 11171  cn 12149  0cn0 12405  chash 14257  cdvds 16183  Basecbs 17140  s cress 17161  SubGrpcsubg 19054  odcod 19457  mulGrpcmgp 20079  Unitcui 20295  IDomncidom 20630
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-inf2 9554  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107  ax-pre-sup 11108  ax-addf 11109
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-iin 4950  df-disj 5067  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-ofr 7625  df-om 7811  df-1st 7935  df-2nd 7936  df-supp 8105  df-tpos 8170  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-2o 8400  df-oadd 8403  df-omul 8404  df-er 8637  df-ec 8639  df-qs 8643  df-map 8769  df-pm 8770  df-ixp 8840  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-fsupp 9269  df-sup 9349  df-inf 9350  df-oi 9419  df-dju 9817  df-card 9855  df-acn 9858  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12150  df-2 12212  df-3 12213  df-4 12214  df-5 12215  df-6 12216  df-7 12217  df-8 12218  df-9 12219  df-n0 12406  df-xnn0 12479  df-z 12493  df-dec 12612  df-uz 12756  df-rp 12910  df-fz 13428  df-fzo 13575  df-fl 13716  df-mod 13794  df-seq 13929  df-exp 13989  df-hash 14258  df-cj 15026  df-re 15027  df-im 15028  df-sqrt 15162  df-abs 15163  df-clim 15415  df-sum 15614  df-dvds 16184  df-struct 17078  df-sets 17095  df-slot 17113  df-ndx 17125  df-base 17141  df-ress 17162  df-plusg 17194  df-mulr 17195  df-starv 17196  df-sca 17197  df-vsca 17198  df-ip 17199  df-tset 17200  df-ple 17201  df-ds 17203  df-unif 17204  df-hom 17205  df-cco 17206  df-0g 17365  df-gsum 17366  df-prds 17371  df-pws 17373  df-mre 17509  df-mrc 17510  df-acs 17512  df-mgm 18569  df-sgrp 18648  df-mnd 18664  df-mhm 18712  df-submnd 18713  df-grp 18870  df-minusg 18871  df-sbg 18872  df-mulg 19002  df-subg 19057  df-eqg 19059  df-ghm 19146  df-cntz 19250  df-od 19461  df-cmn 19715  df-abl 19716  df-mgp 20080  df-rng 20092  df-ur 20121  df-srg 20126  df-ring 20174  df-cring 20175  df-oppr 20277  df-dvdsr 20297  df-unit 20298  df-invr 20328  df-rhm 20412  df-nzr 20450  df-subrng 20483  df-subrg 20507  df-rlreg 20631  df-domn 20632  df-idom 20633  df-lmod 20817  df-lss 20887  df-lsp 20927  df-cnfld 21314  df-assa 21812  df-asp 21813  df-ascl 21814  df-psr 21869  df-mvr 21870  df-mpl 21871  df-opsr 21873  df-evls 22033  df-evl 22034  df-psr1 22124  df-vr1 22125  df-ply1 22126  df-coe1 22127  df-evl1 22264  df-mdeg 26020  df-deg1 26021  df-mon1 26096  df-uc1p 26097  df-q1p 26098  df-r1p 26099
This theorem is referenced by:  proot1mul  43503
  Copyright terms: Public domain W3C validator