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 37292
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 6163 . . . . . . . . 9 (Base‘𝐺) ∈ V
21rabex 4778 . . . . . . . 8 {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V
3 simp2l 1085 . . . . . . . . . . 11 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑦 ∈ (SubGrp‘𝐺))
4 eqid 2621 . . . . . . . . . . . 12 (Base‘𝐺) = (Base‘𝐺)
54subgss 17527 . . . . . . . . . . 11 (𝑦 ∈ (SubGrp‘𝐺) → 𝑦 ⊆ (Base‘𝐺))
63, 5syl 17 . . . . . . . . . 10 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑦 ⊆ (Base‘𝐺))
7 simpl2l 1112 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → 𝑦 ∈ (SubGrp‘𝐺))
8 simp3l 1087 . . . . . . . . . . . . . . 15 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘𝑦) = 𝑁)
9 simp1r 1084 . . . . . . . . . . . . . . . 16 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑁 ∈ ℕ)
109nnnn0d 11303 . . . . . . . . . . . . . . 15 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑁 ∈ ℕ0)
118, 10eqeltrd 2698 . . . . . . . . . . . . . 14 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘𝑦) ∈ ℕ0)
12 vex 3192 . . . . . . . . . . . . . . 15 𝑦 ∈ V
13 hashclb 13097 . . . . . . . . . . . . . . 15 (𝑦 ∈ V → (𝑦 ∈ Fin ↔ (#‘𝑦) ∈ ℕ0))
1412, 13ax-mp 5 . . . . . . . . . . . . . 14 (𝑦 ∈ Fin ↔ (#‘𝑦) ∈ ℕ0)
1511, 14sylibr 224 . . . . . . . . . . . . 13 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑦 ∈ Fin)
1615adantr 481 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → 𝑦 ∈ Fin)
17 simpr 477 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → 𝑧𝑦)
18 eqid 2621 . . . . . . . . . . . . 13 (od‘𝐺) = (od‘𝐺)
1918odsubdvds 17918 . . . . . . . . . . . 12 ((𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑦 ∈ Fin ∧ 𝑧𝑦) → ((od‘𝐺)‘𝑧) ∥ (#‘𝑦))
207, 16, 17, 19syl3anc 1323 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → ((od‘𝐺)‘𝑧) ∥ (#‘𝑦))
218adantr 481 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → (#‘𝑦) = 𝑁)
2220, 21breqtrd 4644 . . . . . . . . . 10 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑦) → ((od‘𝐺)‘𝑧) ∥ 𝑁)
236, 22ssrabdv 3665 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑦 ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
24 simp2r 1086 . . . . . . . . . . 11 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ∈ (SubGrp‘𝐺))
254subgss 17527 . . . . . . . . . . 11 (𝑥 ∈ (SubGrp‘𝐺) → 𝑥 ⊆ (Base‘𝐺))
2624, 25syl 17 . . . . . . . . . 10 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ⊆ (Base‘𝐺))
27 simpl2r 1113 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → 𝑥 ∈ (SubGrp‘𝐺))
28 simp3r 1088 . . . . . . . . . . . . . . 15 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘𝑥) = 𝑁)
2928, 10eqeltrd 2698 . . . . . . . . . . . . . 14 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘𝑥) ∈ ℕ0)
30 vex 3192 . . . . . . . . . . . . . . 15 𝑥 ∈ V
31 hashclb 13097 . . . . . . . . . . . . . . 15 (𝑥 ∈ V → (𝑥 ∈ Fin ↔ (#‘𝑥) ∈ ℕ0))
3230, 31ax-mp 5 . . . . . . . . . . . . . 14 (𝑥 ∈ Fin ↔ (#‘𝑥) ∈ ℕ0)
3329, 32sylibr 224 . . . . . . . . . . . . 13 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ∈ Fin)
3433adantr 481 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → 𝑥 ∈ Fin)
35 simpr 477 . . . . . . . . . . . 12 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → 𝑧𝑥)
3618odsubdvds 17918 . . . . . . . . . . . 12 ((𝑥 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ Fin ∧ 𝑧𝑥) → ((od‘𝐺)‘𝑧) ∥ (#‘𝑥))
3727, 34, 35, 36syl3anc 1323 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → ((od‘𝐺)‘𝑧) ∥ (#‘𝑥))
3828adantr 481 . . . . . . . . . . 11 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → (#‘𝑥) = 𝑁)
3937, 38breqtrd 4644 . . . . . . . . . 10 ((((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑧𝑥) → ((od‘𝐺)‘𝑧) ∥ 𝑁)
4026, 39ssrabdv 3665 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
4123, 40unssd 3772 . . . . . . . 8 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (𝑦𝑥) ⊆ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁})
42 ssdomg 7953 . . . . . . . 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 37290 . . . . . . . . . 10 ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → (#‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ 𝑁)
46453ad2ant1 1080 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ 𝑁)
4746, 8breqtrrd 4646 . . . . . . . 8 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (#‘𝑦))
482a1i 11 . . . . . . . . . 10 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V)
49 hashbnd 13071 . . . . . . . . . 10 (({𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ V ∧ (#‘𝑦) ∈ ℕ0 ∧ (#‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (#‘𝑦)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ Fin)
5048, 11, 47, 49syl3anc 1323 . . . . . . . . 9 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ Fin)
51 hashdom 13116 . . . . . . . . 9 (({𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∈ Fin ∧ 𝑦 ∈ V) → ((#‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (#‘𝑦) ↔ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦))
5250, 12, 51sylancl 693 . . . . . . . 8 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → ((#‘{𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁}) ≤ (#‘𝑦) ↔ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦))
5347, 52mpbid 222 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦)
54 domtr 7961 . . . . . . 7 (((𝑦𝑥) ≼ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ∧ {𝑧 ∈ (Base‘𝐺) ∣ ((od‘𝐺)‘𝑧) ∥ 𝑁} ≼ 𝑦) → (𝑦𝑥) ≼ 𝑦)
5543, 53, 54syl2anc 692 . . . . . 6 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (𝑦𝑥) ≼ 𝑦)
5612, 30unex 6916 . . . . . . 7 (𝑦𝑥) ∈ V
57 ssun1 3759 . . . . . . 7 𝑦 ⊆ (𝑦𝑥)
58 ssdomg 7953 . . . . . . 7 ((𝑦𝑥) ∈ V → (𝑦 ⊆ (𝑦𝑥) → 𝑦 ≼ (𝑦𝑥)))
5956, 57, 58mp2 9 . . . . . 6 𝑦 ≼ (𝑦𝑥)
60 sbth 8032 . . . . . 6 (((𝑦𝑥) ≼ 𝑦𝑦 ≼ (𝑦𝑥)) → (𝑦𝑥) ≈ 𝑦)
6155, 59, 60sylancl 693 . . . . 5 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (𝑦𝑥) ≈ 𝑦)
628, 28eqtr4d 2658 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → (#‘𝑦) = (#‘𝑥))
63 hashen 13083 . . . . . . . 8 ((𝑦 ∈ Fin ∧ 𝑥 ∈ Fin) → ((#‘𝑦) = (#‘𝑥) ↔ 𝑦𝑥))
6415, 33, 63syl2anc 692 . . . . . . 7 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → ((#‘𝑦) = (#‘𝑥) ↔ 𝑦𝑥))
6562, 64mpbid 222 . . . . . 6 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑦𝑥)
66 fiuneneq 37291 . . . . . 6 ((𝑦𝑥𝑦 ∈ Fin) → ((𝑦𝑥) ≈ 𝑦𝑦 = 𝑥))
6765, 15, 66syl2anc 692 . . . . 5 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → ((𝑦𝑥) ≈ 𝑦𝑦 = 𝑥))
6861, 67mpbid 222 . . . 4 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺)) ∧ ((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁)) → 𝑦 = 𝑥)
69683expia 1264 . . 3 (((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) ∧ (𝑦 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ (SubGrp‘𝐺))) → (((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁) → 𝑦 = 𝑥))
7069ralrimivva 2966 . 2 ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → ∀𝑦 ∈ (SubGrp‘𝐺)∀𝑥 ∈ (SubGrp‘𝐺)(((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁) → 𝑦 = 𝑥))
71 fveq2 6153 . . . 4 (𝑦 = 𝑥 → (#‘𝑦) = (#‘𝑥))
7271eqeq1d 2623 . . 3 (𝑦 = 𝑥 → ((#‘𝑦) = 𝑁 ↔ (#‘𝑥) = 𝑁))
7372rmo4 3385 . 2 (∃*𝑦 ∈ (SubGrp‘𝐺)(#‘𝑦) = 𝑁 ↔ ∀𝑦 ∈ (SubGrp‘𝐺)∀𝑥 ∈ (SubGrp‘𝐺)(((#‘𝑦) = 𝑁 ∧ (#‘𝑥) = 𝑁) → 𝑦 = 𝑥))
7470, 73sylibr 224 1 ((𝑅 ∈ IDomn ∧ 𝑁 ∈ ℕ) → ∃*𝑦 ∈ (SubGrp‘𝐺)(#‘𝑦) = 𝑁)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1036   = wceq 1480  wcel 1987  wral 2907  ∃*wrmo 2910  {crab 2911  Vcvv 3189  cun 3557  wss 3559   class class class wbr 4618  cfv 5852  (class class class)co 6610  cen 7904  cdom 7905  Fincfn 7907  cle 10027  cn 10972  0cn0 11244  #chash 13065  cdvds 14918  Basecbs 15792  s cress 15793  SubGrpcsubg 17520  odcod 17876  mulGrpcmgp 18421  Unitcui 18571  IDomncidom 19213
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 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-inf2 8490  ax-cnex 9944  ax-resscn 9945  ax-1cn 9946  ax-icn 9947  ax-addcl 9948  ax-addrcl 9949  ax-mulcl 9950  ax-mulrcl 9951  ax-mulcom 9952  ax-addass 9953  ax-mulass 9954  ax-distr 9955  ax-i2m1 9956  ax-1ne0 9957  ax-1rid 9958  ax-rnegex 9959  ax-rrecex 9960  ax-cnre 9961  ax-pre-lttri 9962  ax-pre-lttrn 9963  ax-pre-ltadd 9964  ax-pre-mulgt0 9965  ax-pre-sup 9966  ax-addf 9967  ax-mulf 9968
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-fal 1486  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 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-pss 3575  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-iin 4493  df-disj 4589  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-se 5039  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5644  df-ord 5690  df-on 5691  df-lim 5692  df-suc 5693  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-isom 5861  df-riota 6571  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-of 6857  df-ofr 6858  df-om 7020  df-1st 7120  df-2nd 7121  df-supp 7248  df-tpos 7304  df-wrecs 7359  df-recs 7420  df-rdg 7458  df-1o 7512  df-2o 7513  df-oadd 7516  df-omul 7517  df-er 7694  df-ec 7696  df-qs 7700  df-map 7811  df-pm 7812  df-ixp 7861  df-en 7908  df-dom 7909  df-sdom 7910  df-fin 7911  df-fsupp 8228  df-sup 8300  df-inf 8301  df-oi 8367  df-card 8717  df-acn 8720  df-cda 8942  df-pnf 10028  df-mnf 10029  df-xr 10030  df-ltxr 10031  df-le 10032  df-sub 10220  df-neg 10221  df-div 10637  df-nn 10973  df-2 11031  df-3 11032  df-4 11033  df-5 11034  df-6 11035  df-7 11036  df-8 11037  df-9 11038  df-n0 11245  df-xnn0 11316  df-z 11330  df-dec 11446  df-uz 11640  df-rp 11785  df-fz 12277  df-fzo 12415  df-fl 12541  df-mod 12617  df-seq 12750  df-exp 12809  df-hash 13066  df-cj 13781  df-re 13782  df-im 13783  df-sqrt 13917  df-abs 13918  df-clim 14161  df-sum 14359  df-dvds 14919  df-struct 15794  df-ndx 15795  df-slot 15796  df-base 15797  df-sets 15798  df-ress 15799  df-plusg 15886  df-mulr 15887  df-starv 15888  df-sca 15889  df-vsca 15890  df-ip 15891  df-tset 15892  df-ple 15893  df-ds 15896  df-unif 15897  df-hom 15898  df-cco 15899  df-0g 16034  df-gsum 16035  df-prds 16040  df-pws 16042  df-mre 16178  df-mrc 16179  df-acs 16181  df-mgm 17174  df-sgrp 17216  df-mnd 17227  df-mhm 17267  df-submnd 17268  df-grp 17357  df-minusg 17358  df-sbg 17359  df-mulg 17473  df-subg 17523  df-eqg 17525  df-ghm 17590  df-cntz 17682  df-od 17880  df-cmn 18127  df-abl 18128  df-mgp 18422  df-ur 18434  df-srg 18438  df-ring 18481  df-cring 18482  df-oppr 18555  df-dvdsr 18573  df-unit 18574  df-invr 18604  df-rnghom 18647  df-subrg 18710  df-lmod 18797  df-lss 18865  df-lsp 18904  df-nzr 19190  df-rlreg 19215  df-domn 19216  df-idom 19217  df-assa 19244  df-asp 19245  df-ascl 19246  df-psr 19288  df-mvr 19289  df-mpl 19290  df-opsr 19292  df-evls 19438  df-evl 19439  df-psr1 19482  df-vr1 19483  df-ply1 19484  df-coe1 19485  df-evl1 19613  df-cnfld 19679  df-mdeg 23736  df-deg1 23737  df-mon1 23811  df-uc1p 23812  df-q1p 23813  df-r1p 23814
This theorem is referenced by:  proot1mul  37293
  Copyright terms: Public domain W3C validator