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

Theorem imasgrp2 19315
Description: The image structure of a group is a group. (Contributed by Mario Carneiro, 24-Feb-2015.) (Revised by Mario Carneiro, 5-Sep-2015.)
Hypotheses
Ref Expression
imasgrp.u (𝜑 → 𝑈 = (𝐹 “s 𝑅))
imasgrp.v (𝜑 → 𝑉 = (Base‘𝑅))
imasgrp.p (𝜑 → + = (+g‘𝑅))
imasgrp.f (𝜑 → 𝐹:𝑉⟶onto𝐵)
imasgrp.e ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
imasgrp2.r (𝜑 → 𝑅 ∈ 𝑊)
imasgrp2.1 ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
imasgrp2.2 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
imasgrp2.3 (𝜑 → 0 ∈ 𝑉)
imasgrp2.4 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹‘𝑥))
imasgrp2.5 ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑁 ∈ 𝑉)
imasgrp2.6 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘(𝑁 + 𝑥)) = (𝐹‘ 0 ))
Assertion
Ref Expression
imasgrp2 (𝜑 → (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
Distinct variable groups:   𝑞,𝑝,𝑥,𝐵   𝑁,𝑝   𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧,𝜑   𝑅,𝑝,𝑞   𝐹,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧   + ,𝑝,𝑞,𝑥,𝑦   𝑈,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧   𝑉,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧   0 ,𝑝,𝑞,𝑥
Allowed substitution hints:   𝐵(𝑦, 𝑧, 𝑎, 𝑏)   + (𝑧, 𝑎, 𝑏)   𝑅(𝑥, 𝑦, 𝑧, 𝑎, 𝑏)   𝑁(𝑥, 𝑦, 𝑧, 𝑞, 𝑎, 𝑏)   𝑊(𝑥, 𝑦, 𝑧, 𝑞, 𝑝, 𝑎, 𝑏)   0 (𝑦, 𝑧, 𝑎, 𝑏)

Proof of Theorem imasgrp2
Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imasgrp.u . . . 4 (𝜑 → 𝑈 = (𝐹 “s 𝑅))
2 imasgrp.v . . . 4 (𝜑 → 𝑉 = (Base‘𝑅))
3 imasgrp.f . . . 4 (𝜑 → 𝐹:𝑉⟶onto𝐵)
4 imasgrp2.r . . . 4 (𝜑 → 𝑅 ∈ 𝑊)
51, 2, 3, 4imasbas 17734 . . 3 (𝜑 → 𝐵 = (Base‘𝑈))
6 eqidd 2764 . . 3 (𝜑 → (+g‘𝑈) = (+g‘𝑈))
7 imasgrp.e . . . . . 6 ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
8 imasgrp.p . . . . . . . . . 10 (𝜑 → + = (+g‘𝑅))
98oveqd 7468 . . . . . . . . 9 (𝜑 → (𝑎 + 𝑏) = (𝑎(+g‘𝑅)𝑏))
109fveq2d 6920 . . . . . . . 8 (𝜑 → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑎(+g‘𝑅)𝑏)))
118oveqd 7468 . . . . . . . . 9 (𝜑 → (𝑝 + 𝑞) = (𝑝(+g‘𝑅)𝑞))
1211fveq2d 6920 . . . . . . . 8 (𝜑 → (𝐹‘(𝑝 + 𝑞)) = (𝐹‘(𝑝(+g‘𝑅)𝑞)))
1310, 12eqeq12d 2779 . . . . . . 7 (𝜑 → ((𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞)) ↔ (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞))))
14133ad2ant1 1151 . . . . . 6 ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞)) ↔ (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞))))
157, 14sylibd 242 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞))))
16 eqid 2763 . . . . 5 (+g‘𝑅) = (+g‘𝑅)
17 eqid 2763 . . . . 5 (+g‘𝑈) = (+g‘𝑈)
1811adantr 486 . . . . . 6 ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 + 𝑞) = (𝑝(+g‘𝑅)𝑞))
19 imasgrp2.1 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
20193expb 1138 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
2120caovclg 7645 . . . . . 6 ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 + 𝑞) ∈ 𝑉)
2218, 21eqeltrrd 2865 . . . . 5 ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝(+g‘𝑅)𝑞) ∈ 𝑉)
233, 15, 1, 2, 4, 16, 17, 22imasaddf 17755 . . . 4 (𝜑 → (+g‘𝑈):(𝐵 × 𝐵)⟶𝐵)
24 fovcdm 7623 . . . 4 (((+g‘𝑈):(𝐵 × 𝐵)⟶𝐵 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) → (𝑢(+g‘𝑈)𝑣) ∈ 𝐵)
2523, 24syl3an1 1181 . . 3 ((𝜑 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) → (𝑢(+g‘𝑈)𝑣) ∈ 𝐵)
26 forn 6829 . . . . . . . . . 10 (𝐹:𝑉⟶onto𝐵 → ran 𝐹 = 𝐵)
273, 26syl 18 . . . . . . . . 9 (𝜑 → ran 𝐹 = 𝐵)
2827eleq2d 2850 . . . . . . . 8 (𝜑 → (𝑢 ∈ ran 𝐹 ↔ 𝑢 ∈ 𝐵))
2927eleq2d 2850 . . . . . . . 8 (𝜑 → (𝑣 ∈ ran 𝐹 ↔ 𝑣 ∈ 𝐵))
3027eleq2d 2850 . . . . . . . 8 (𝜑 → (𝑤 ∈ ran 𝐹 ↔ 𝑤 ∈ 𝐵))
3128, 29, 303anbi123d 1465 . . . . . . 7 (𝜑 → ((𝑢 ∈ ran 𝐹 ∧ 𝑣 ∈ ran 𝐹 ∧ 𝑤 ∈ ran 𝐹) ↔ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)))
32 fofn 6828 . . . . . . . . 9 (𝐹:𝑉⟶onto𝐵 → 𝐹 Fn 𝑉)
333, 32syl 18 . . . . . . . 8 (𝜑 → 𝐹 Fn 𝑉)
34 fvelrnb 6976 . . . . . . . . 9 (𝐹 Fn 𝑉 → (𝑢 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢))
35 fvelrnb 6976 . . . . . . . . 9 (𝐹 Fn 𝑉 → (𝑣 ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣))
36 fvelrnb 6976 . . . . . . . . 9 (𝐹 Fn 𝑉 → (𝑤 ∈ ran 𝐹 ↔ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤))
3734, 35, 363anbi123d 1465 . . . . . . . 8 (𝐹 Fn 𝑉 → ((𝑢 ∈ ran 𝐹 ∧ 𝑣 ∈ ran 𝐹 ∧ 𝑤 ∈ ran 𝐹) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤)))
3833, 37syl 18 . . . . . . 7 (𝜑 → ((𝑢 ∈ ran 𝐹 ∧ 𝑣 ∈ ran 𝐹 ∧ 𝑤 ∈ ran 𝐹) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤)))
3931, 38bitr3d 284 . . . . . 6 (𝜑 → ((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤)))
40 3reeanv 3239 . . . . . 6 (∃𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤))
4139, 40bitr4di 292 . . . . 5 (𝜑 → ((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) ↔ ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤)))
42 imasgrp2.2 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
438adantr 486 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → + = (+g‘𝑅))
4443oveqd 7468 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝑥 + 𝑦) + 𝑧) = ((𝑥 + 𝑦)(+g‘𝑅)𝑧))
4544fveq2d 6920 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘((𝑥 + 𝑦)(+g‘𝑅)𝑧)))
4643oveqd 7468 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g‘𝑅)(𝑦 + 𝑧)))
4746fveq2d 6920 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘(𝑥 + (𝑦 + 𝑧))) = (𝐹‘(𝑥(+g‘𝑅)(𝑦 + 𝑧))))
4842, 45, 473eqtr3d 2806 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦)(+g‘𝑅)𝑧)) = (𝐹‘(𝑥(+g‘𝑅)(𝑦 + 𝑧))))
49 simpl 488 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝜑)
50193adant3r3 1203 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
51 simpr3 1215 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑧 ∈ 𝑉)
523, 15, 1, 2, 4, 16, 17imasaddval 17754 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 + 𝑦) ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘((𝑥 + 𝑦)(+g‘𝑅)𝑧)))
5349, 50, 51, 52syl3anc 1399 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘((𝑥 + 𝑦)(+g‘𝑅)𝑧)))
54 simpr1 1213 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑥 ∈ 𝑉)
5521caovclg 7645 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑦 + 𝑧) ∈ 𝑉)
56553adantr1 1188 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑦 + 𝑧) ∈ 𝑉)
573, 15, 1, 2, 4, 16, 17imasaddval 17754 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ (𝑦 + 𝑧) ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))) = (𝐹‘(𝑥(+g‘𝑅)(𝑦 + 𝑧))))
5849, 54, 56, 57syl3anc 1399 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))) = (𝐹‘(𝑥(+g‘𝑅)(𝑦 + 𝑧))))
5948, 53, 583eqtr4d 2808 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))))
603, 15, 1, 2, 4, 16, 17imasaddval 17754 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝐹‘(𝑥(+g‘𝑅)𝑦)))
61603adant3r3 1203 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝐹‘(𝑥(+g‘𝑅)𝑦)))
6243oveqd 7468 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑥 + 𝑦) = (𝑥(+g‘𝑅)𝑦))
6362fveq2d 6920 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑥(+g‘𝑅)𝑦)))
6461, 63eqtr4d 2801 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝐹‘(𝑥 + 𝑦)))
6564oveq1d 7466 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)))
663, 15, 1, 2, 4, 16, 17imasaddval 17754 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘(𝑦(+g‘𝑅)𝑧)))
67663adant3r1 1201 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘(𝑦(+g‘𝑅)𝑧)))
6843oveqd 7468 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑦 + 𝑧) = (𝑦(+g‘𝑅)𝑧))
6968fveq2d 6920 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘(𝑦 + 𝑧)) = (𝐹‘(𝑦(+g‘𝑅)𝑧)))
7067, 69eqtr4d 2801 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘(𝑦 + 𝑧)))
7170oveq2d 7467 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))))
7259, 65, 713eqtr4d 2808 . . . . . . . . . 10 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))))
73 simp1 1154 . . . . . . . . . . . . 13 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (𝐹‘𝑥) = 𝑢)
74 simp2 1155 . . . . . . . . . . . . 13 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (𝐹‘𝑦) = 𝑣)
7573, 74oveq12d 7469 . . . . . . . . . . . 12 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝑢(+g‘𝑈)𝑣))
76 simp3 1156 . . . . . . . . . . . 12 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (𝐹‘𝑧) = 𝑤)
7775, 76oveq12d 7469 . . . . . . . . . . 11 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤))
7874, 76oveq12d 7469 . . . . . . . . . . . 12 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝑣(+g‘𝑈)𝑤))
7973, 78oveq12d 7469 . . . . . . . . . . 11 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))
8077, 79eqeq12d 2779 . . . . . . . . . 10 (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))) ↔ ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
8172, 80syl5ibcom 248 . . . . . . . . 9 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
82813exp2 1373 . . . . . . . 8 (𝜑 → (𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑉 → (𝑧 ∈ 𝑉 → (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))))))
8382imp32 424 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑧 ∈ 𝑉 → (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))))
8483rexlimdv 3165 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
8584rexlimdvva 3223 . . . . 5 (𝜑 → (∃𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
8641, 85sylbid 243 . . . 4 (𝜑 → ((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
8786imp 412 . . 3 ((𝜑 ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))
88 fof 6826 . . . . 5 (𝐹:𝑉⟶onto𝐵 → 𝐹:𝑉⟶𝐵)
893, 88syl 18 . . . 4 (𝜑 → 𝐹:𝑉⟶𝐵)
90 imasgrp2.3 . . . 4 (𝜑 → 0 ∈ 𝑉)
9189, 90ffvelcdmd 7117 . . 3 (𝜑 → (𝐹‘ 0 ) ∈ 𝐵)
9233, 34syl 18 . . . . . 6 (𝜑 → (𝑢 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢))
9328, 92bitr3d 284 . . . . 5 (𝜑 → (𝑢 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢))
94 simpl 488 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝜑)
9590adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑉)
96 simpr 490 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑉)
973, 15, 1, 2, 4, 16, 17imasaddval 17754 . . . . . . . . 9 ((𝜑 ∧ 0 ∈ 𝑉 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘( 0 (+g‘𝑅)𝑥)))
9894, 95, 96, 97syl3anc 1399 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘( 0 (+g‘𝑅)𝑥)))
998adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝑉) → + = (+g‘𝑅))
10099oveqd 7468 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ( 0 + 𝑥) = ( 0 (+g‘𝑅)𝑥))
101100fveq2d 6920 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹‘( 0 (+g‘𝑅)𝑥)))
102 imasgrp2.4 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹‘𝑥))
10398, 101, 1023eqtr2d 2804 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘𝑥))
104 oveq2 7459 . . . . . . . 8 ((𝐹‘𝑥) = 𝑢 → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = ((𝐹‘ 0 )(+g‘𝑈)𝑢))
105 id 23 . . . . . . . 8 ((𝐹‘𝑥) = 𝑢 → (𝐹‘𝑥) = 𝑢)
106104, 105eqeq12d 2779 . . . . . . 7 ((𝐹‘𝑥) = 𝑢 → (((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘𝑥) ↔ ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
107103, 106syl5ibcom 248 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑥) = 𝑢 → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
108107rexlimdva 3167 . . . . 5 (𝜑 → (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
10993, 108sylbid 243 . . . 4 (𝜑 → (𝑢 ∈ 𝐵 → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
110109imp 412 . . 3 ((𝜑 ∧ 𝑢 ∈ 𝐵) → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢)
11189adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝐹:𝑉⟶𝐵)
112 imasgrp2.5 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑁 ∈ 𝑉)
113111, 112ffvelcdmd 7117 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘𝑁) ∈ 𝐵)
1143, 15, 1, 2, 4, 16, 17imasaddval 17754 . . . . . . . . . 10 ((𝜑 ∧ 𝑁 ∈ 𝑉 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑁)(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘(𝑁(+g‘𝑅)𝑥)))
11594, 112, 96, 114syl3anc 1399 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑁)(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘(𝑁(+g‘𝑅)𝑥)))
11699oveqd 7468 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝑁 + 𝑥) = (𝑁(+g‘𝑅)𝑥))
117116fveq2d 6920 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘(𝑁 + 𝑥)) = (𝐹‘(𝑁(+g‘𝑅)𝑥)))
118 imasgrp2.6 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘(𝑁 + 𝑥)) = (𝐹‘ 0 ))
119115, 117, 1183eqtr2d 2804 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑁)(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 ))
120 oveq1 7458 . . . . . . . . . 10 (𝑣 = (𝐹‘𝑁) → (𝑣(+g‘𝑈)(𝐹‘𝑥)) = ((𝐹‘𝑁)(+g‘𝑈)(𝐹‘𝑥)))
121120eqeq1d 2765 . . . . . . . . 9 (𝑣 = (𝐹‘𝑁) → ((𝑣(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 ) ↔ ((𝐹‘𝑁)(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 )))
122121rspcev 3580 . . . . . . . 8 (((𝐹‘𝑁) ∈ 𝐵 ∧ ((𝐹‘𝑁)(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 )) → ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 ))
123113, 119, 122syl2anc 596 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 ))
124 oveq2 7459 . . . . . . . . 9 ((𝐹‘𝑥) = 𝑢 → (𝑣(+g‘𝑈)(𝐹‘𝑥)) = (𝑣(+g‘𝑈)𝑢))
125124eqeq1d 2765 . . . . . . . 8 ((𝐹‘𝑥) = 𝑢 → ((𝑣(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 ) ↔ (𝑣(+g‘𝑈)𝑢) = (𝐹‘ 0 )))
126125rexbidv 3190 . . . . . . 7 ((𝐹‘𝑥) = 𝑢 → (∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘ 0 ) ↔ ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)𝑢) = (𝐹‘ 0 )))
127123, 126syl5ibcom 248 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑥) = 𝑢 → ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)𝑢) = (𝐹‘ 0 )))
128127rexlimdva 3167 . . . . 5 (𝜑 → (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 → ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)𝑢) = (𝐹‘ 0 )))
12993, 128sylbid 243 . . . 4 (𝜑 → (𝑢 ∈ 𝐵 → ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)𝑢) = (𝐹‘ 0 )))
130129imp 412 . . 3 ((𝜑 ∧ 𝑢 ∈ 𝐵) → ∃𝑣 ∈ 𝐵 (𝑣(+g‘𝑈)𝑢) = (𝐹‘ 0 ))
1315, 6, 25, 87, 91, 110, 130isgrpde 19218 . 2 (𝜑 → 𝑈 ∈ Grp)
1325, 6, 91, 110, 131grpidd2 19238 . 2 (𝜑 → (𝐹‘ 0 ) = (0g‘𝑈))
133131, 132jca 521 1 (𝜑 → (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   × cxp 5656  ran crn 5659   Fn wfn 6561  ⟶wf 6562  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660   “s cimas 17726  Grpcgrp 19194
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-inf 9472  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-z 12734  df-dec 12855  df-uz 13006  df-fz 13680  df-struct 17369  df-slot 17404  df-ndx 17416  df-base 17432  df-plusg 17486  df-mulr 17487  df-sca 17489  df-vsca 17490  df-ip 17491  df-tset 17492  df-ple 17493  df-ds 17495  df-0g 17662  df-imas 17730  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197
This theorem is used by:  imasgrp  19316  qusgrp2  19318
  Copyright terms: Public domain W3C validator