ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  imasgrp GIF version

Theorem imasgrp 13663
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 ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → (((𝐹𝑎) = (𝐹𝑝) ∧ (𝐹𝑏) = (𝐹𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
imasgrp.r (𝜑𝑅 ∈ Grp)
imasgrp.z 0 = (0g𝑅)
Assertion
Ref Expression
imasgrp (𝜑 → (𝑈 ∈ Grp ∧ (𝐹0 ) = (0g𝑈)))
Distinct variable groups:   𝑞,𝑝,𝐵   𝑎,𝑏,𝑝,𝑞,𝜑   𝑅,𝑝,𝑞   𝐹,𝑎,𝑏,𝑝,𝑞   + ,𝑝,𝑞   𝑈,𝑎,𝑏,𝑝,𝑞   𝑉,𝑎,𝑏,𝑝,𝑞   0 ,𝑝,𝑞
Allowed substitution hints:   𝐵(𝑎,𝑏)   + (𝑎,𝑏)   𝑅(𝑎,𝑏)   0 (𝑎,𝑏)

Proof of Theorem imasgrp
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imasgrp.u . 2 (𝜑𝑈 = (𝐹s 𝑅))
2 imasgrp.v . 2 (𝜑𝑉 = (Base‘𝑅))
3 imasgrp.p . 2 (𝜑+ = (+g𝑅))
4 imasgrp.f . 2 (𝜑𝐹:𝑉onto𝐵)
5 imasgrp.e . 2 ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → (((𝐹𝑎) = (𝐹𝑝) ∧ (𝐹𝑏) = (𝐹𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
6 imasgrp.r . 2 (𝜑𝑅 ∈ Grp)
763ad2ant1 1042 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑅 ∈ Grp)
8 simp2 1022 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥𝑉)
923ad2ant1 1042 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑉 = (Base‘𝑅))
108, 9eleqtrd 2308 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥 ∈ (Base‘𝑅))
11 simp3 1023 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦𝑉)
1211, 9eleqtrd 2308 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦 ∈ (Base‘𝑅))
13 eqid 2229 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
14 eqid 2229 . . . . 5 (+g𝑅) = (+g𝑅)
1513, 14grpcl 13556 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
167, 10, 12, 15syl3anc 1271 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
1733ad2ant1 1042 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → + = (+g𝑅))
1817oveqd 6024 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
1916, 18, 93eltr4d 2313 . 2 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
206adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑅 ∈ Grp)
21103adant3r3 1238 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 ∈ (Base‘𝑅))
22123adant3r3 1238 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑦 ∈ (Base‘𝑅))
23 simpr3 1029 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧𝑉)
242adantr 276 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑉 = (Base‘𝑅))
2523, 24eleqtrd 2308 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 ∈ (Base‘𝑅))
2613, 14grpass 13557 . . . . 5 ((𝑅 ∈ Grp ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
2720, 21, 22, 25, 26syl13anc 1273 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
283adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → + = (+g𝑅))
29183adant3r3 1238 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
30 eqidd 2230 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 = 𝑧)
3128, 29, 30oveq123d 6028 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧))
32 eqidd 2230 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 = 𝑥)
3328oveqd 6024 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑦 + 𝑧) = (𝑦(+g𝑅)𝑧))
3428, 32, 33oveq123d 6028 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
3527, 31, 343eqtr4d 2272 . . 3 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
3635fveq2d 5633 . 2 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
37 imasgrp.z . . . . 5 0 = (0g𝑅)
3813, 37grpidcl 13577 . . . 4 (𝑅 ∈ Grp → 0 ∈ (Base‘𝑅))
396, 38syl 14 . . 3 (𝜑0 ∈ (Base‘𝑅))
4039, 2eleqtrrd 2309 . 2 (𝜑0𝑉)
413adantr 276 . . . . 5 ((𝜑𝑥𝑉) → + = (+g𝑅))
4241oveqd 6024 . . . 4 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = ( 0 (+g𝑅)𝑥))
432eleq2d 2299 . . . . . 6 (𝜑 → (𝑥𝑉𝑥 ∈ (Base‘𝑅)))
4443biimpa 296 . . . . 5 ((𝜑𝑥𝑉) → 𝑥 ∈ (Base‘𝑅))
4513, 14, 37grplid 13579 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ( 0 (+g𝑅)𝑥) = 𝑥)
466, 44, 45syl2an2r 597 . . . 4 ((𝜑𝑥𝑉) → ( 0 (+g𝑅)𝑥) = 𝑥)
4742, 46eqtrd 2262 . . 3 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = 𝑥)
4847fveq2d 5633 . 2 ((𝜑𝑥𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹𝑥))
49 eqid 2229 . . . . 5 (invg𝑅) = (invg𝑅)
5013, 49grpinvcl 13596 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
516, 44, 50syl2an2r 597 . . 3 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
522adantr 276 . . 3 ((𝜑𝑥𝑉) → 𝑉 = (Base‘𝑅))
5351, 52eleqtrrd 2309 . 2 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ 𝑉)
5441oveqd 6024 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = (((invg𝑅)‘𝑥)(+g𝑅)𝑥))
5513, 14, 37, 49grplinv 13598 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
566, 44, 55syl2an2r 597 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
5754, 56eqtrd 2262 . . 3 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = 0 )
5857fveq2d 5633 . 2 ((𝜑𝑥𝑉) → (𝐹‘(((invg𝑅)‘𝑥) + 𝑥)) = (𝐹0 ))
591, 2, 3, 4, 5, 6, 19, 36, 40, 48, 53, 58imasgrp2 13662 1 (𝜑 → (𝑈 ∈ Grp ∧ (𝐹0 ) = (0g𝑈)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1002   = wceq 1395  wcel 2200  ontowfo 5316  cfv 5318  (class class class)co 6007  Basecbs 13047  +gcplusg 13125  0gc0g 13304  s cimas 13347  Grpcgrp 13548  invgcminusg 13549
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-pre-ltirr 8122  ax-pre-lttrn 8124  ax-pre-ltadd 8126
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-tp 3674  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-ltxr 8197  df-inn 9122  df-2 9180  df-3 9181  df-ndx 13050  df-slot 13051  df-base 13053  df-plusg 13138  df-mulr 13139  df-0g 13306  df-iimas 13350  df-mgm 13404  df-sgrp 13450  df-mnd 13465  df-grp 13551  df-minusg 13552
This theorem is referenced by:  imasgrpf1  13664  imasabl  13888  imasring  14042
  Copyright terms: Public domain W3C validator