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

Theorem imasgrp 13241
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 1020 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑅 ∈ Grp)
8 simp2 1000 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥𝑉)
923ad2ant1 1020 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑉 = (Base‘𝑅))
108, 9eleqtrd 2275 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥 ∈ (Base‘𝑅))
11 simp3 1001 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦𝑉)
1211, 9eleqtrd 2275 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦 ∈ (Base‘𝑅))
13 eqid 2196 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
14 eqid 2196 . . . . 5 (+g𝑅) = (+g𝑅)
1513, 14grpcl 13140 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
167, 10, 12, 15syl3anc 1249 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
1733ad2ant1 1020 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → + = (+g𝑅))
1817oveqd 5939 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
1916, 18, 93eltr4d 2280 . 2 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
206adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑅 ∈ Grp)
21103adant3r3 1216 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 ∈ (Base‘𝑅))
22123adant3r3 1216 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑦 ∈ (Base‘𝑅))
23 simpr3 1007 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧𝑉)
242adantr 276 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑉 = (Base‘𝑅))
2523, 24eleqtrd 2275 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 ∈ (Base‘𝑅))
2613, 14grpass 13141 . . . . 5 ((𝑅 ∈ Grp ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
2720, 21, 22, 25, 26syl13anc 1251 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
283adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → + = (+g𝑅))
29183adant3r3 1216 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
30 eqidd 2197 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 = 𝑧)
3128, 29, 30oveq123d 5943 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧))
32 eqidd 2197 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 = 𝑥)
3328oveqd 5939 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑦 + 𝑧) = (𝑦(+g𝑅)𝑧))
3428, 32, 33oveq123d 5943 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
3527, 31, 343eqtr4d 2239 . . 3 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
3635fveq2d 5562 . 2 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
37 imasgrp.z . . . . 5 0 = (0g𝑅)
3813, 37grpidcl 13161 . . . 4 (𝑅 ∈ Grp → 0 ∈ (Base‘𝑅))
396, 38syl 14 . . 3 (𝜑0 ∈ (Base‘𝑅))
4039, 2eleqtrrd 2276 . 2 (𝜑0𝑉)
413adantr 276 . . . . 5 ((𝜑𝑥𝑉) → + = (+g𝑅))
4241oveqd 5939 . . . 4 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = ( 0 (+g𝑅)𝑥))
432eleq2d 2266 . . . . . 6 (𝜑 → (𝑥𝑉𝑥 ∈ (Base‘𝑅)))
4443biimpa 296 . . . . 5 ((𝜑𝑥𝑉) → 𝑥 ∈ (Base‘𝑅))
4513, 14, 37grplid 13163 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ( 0 (+g𝑅)𝑥) = 𝑥)
466, 44, 45syl2an2r 595 . . . 4 ((𝜑𝑥𝑉) → ( 0 (+g𝑅)𝑥) = 𝑥)
4742, 46eqtrd 2229 . . 3 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = 𝑥)
4847fveq2d 5562 . 2 ((𝜑𝑥𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹𝑥))
49 eqid 2196 . . . . 5 (invg𝑅) = (invg𝑅)
5013, 49grpinvcl 13180 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
516, 44, 50syl2an2r 595 . . 3 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
522adantr 276 . . 3 ((𝜑𝑥𝑉) → 𝑉 = (Base‘𝑅))
5351, 52eleqtrrd 2276 . 2 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ 𝑉)
5441oveqd 5939 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = (((invg𝑅)‘𝑥)(+g𝑅)𝑥))
5513, 14, 37, 49grplinv 13182 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
566, 44, 55syl2an2r 595 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
5754, 56eqtrd 2229 . . 3 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = 0 )
5857fveq2d 5562 . 2 ((𝜑𝑥𝑉) → (𝐹‘(((invg𝑅)‘𝑥) + 𝑥)) = (𝐹0 ))
591, 2, 3, 4, 5, 6, 19, 36, 40, 48, 53, 58imasgrp2 13240 1 (𝜑 → (𝑈 ∈ Grp ∧ (𝐹0 ) = (0g𝑈)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2167  ontowfo 5256  cfv 5258  (class class class)co 5922  Basecbs 12678  +gcplusg 12755  0gc0g 12927  s cimas 12942  Grpcgrp 13132  invgcminusg 13133
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-pre-ltirr 7991  ax-pre-lttrn 7993  ax-pre-ltadd 7995
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-tp 3630  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-pnf 8063  df-mnf 8064  df-ltxr 8066  df-inn 8991  df-2 9049  df-3 9050  df-ndx 12681  df-slot 12682  df-base 12684  df-plusg 12768  df-mulr 12769  df-0g 12929  df-iimas 12945  df-mgm 12999  df-sgrp 13045  df-mnd 13058  df-grp 13135  df-minusg 13136
This theorem is referenced by:  imasgrpf1  13242  imasabl  13466  imasring  13620
  Copyright terms: Public domain W3C validator