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

Theorem imasgrp 13891
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 1049 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑅 ∈ Grp)
8 simp2 1029 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥𝑉)
923ad2ant1 1049 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑉 = (Base‘𝑅))
108, 9eleqtrd 2317 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥 ∈ (Base‘𝑅))
11 simp3 1030 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦𝑉)
1211, 9eleqtrd 2317 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦 ∈ (Base‘𝑅))
13 eqid 2238 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
14 eqid 2238 . . . . 5 (+g𝑅) = (+g𝑅)
1513, 14grpcl 13790 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
167, 10, 12, 15syl3anc 1278 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
1733ad2ant1 1049 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → + = (+g𝑅))
1817oveqd 6092 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
1916, 18, 93eltr4d 2322 . 2 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
206adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑅 ∈ Grp)
21103adant3r3 1245 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 ∈ (Base‘𝑅))
22123adant3r3 1245 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑦 ∈ (Base‘𝑅))
23 simpr3 1036 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧𝑉)
242adantr 276 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑉 = (Base‘𝑅))
2523, 24eleqtrd 2317 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 ∈ (Base‘𝑅))
2613, 14grpass 13791 . . . . 5 ((𝑅 ∈ Grp ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
2720, 21, 22, 25, 26syl13anc 1280 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
283adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → + = (+g𝑅))
29183adant3r3 1245 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
30 eqidd 2239 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 = 𝑧)
3128, 29, 30oveq123d 6096 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧))
32 eqidd 2239 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 = 𝑥)
3328oveqd 6092 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑦 + 𝑧) = (𝑦(+g𝑅)𝑧))
3428, 32, 33oveq123d 6096 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
3527, 31, 343eqtr4d 2281 . . 3 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
3635fveq2d 5694 . 2 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
37 imasgrp.z . . . . 5 0 = (0g𝑅)
3813, 37grpidcl 13811 . . . 4 (𝑅 ∈ Grp → 0 ∈ (Base‘𝑅))
396, 38syl 14 . . 3 (𝜑0 ∈ (Base‘𝑅))
4039, 2eleqtrrd 2318 . 2 (𝜑0𝑉)
413adantr 276 . . . . 5 ((𝜑𝑥𝑉) → + = (+g𝑅))
4241oveqd 6092 . . . 4 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = ( 0 (+g𝑅)𝑥))
432eleq2d 2308 . . . . . 6 (𝜑 → (𝑥𝑉𝑥 ∈ (Base‘𝑅)))
4443biimpa 296 . . . . 5 ((𝜑𝑥𝑉) → 𝑥 ∈ (Base‘𝑅))
4513, 14, 37grplid 13813 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ( 0 (+g𝑅)𝑥) = 𝑥)
466, 44, 45syl2an2r 603 . . . 4 ((𝜑𝑥𝑉) → ( 0 (+g𝑅)𝑥) = 𝑥)
4742, 46eqtrd 2271 . . 3 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = 𝑥)
4847fveq2d 5694 . 2 ((𝜑𝑥𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹𝑥))
49 eqid 2238 . . . . 5 (invg𝑅) = (invg𝑅)
5013, 49grpinvcl 13830 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
516, 44, 50syl2an2r 603 . . 3 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
522adantr 276 . . 3 ((𝜑𝑥𝑉) → 𝑉 = (Base‘𝑅))
5351, 52eleqtrrd 2318 . 2 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ 𝑉)
5441oveqd 6092 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = (((invg𝑅)‘𝑥)(+g𝑅)𝑥))
5513, 14, 37, 49grplinv 13832 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
566, 44, 55syl2an2r 603 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
5754, 56eqtrd 2271 . . 3 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = 0 )
5857fveq2d 5694 . 2 ((𝜑𝑥𝑉) → (𝐹‘(((invg𝑅)‘𝑥) + 𝑥)) = (𝐹0 ))
591, 2, 3, 4, 5, 6, 19, 36, 40, 48, 53, 58imasgrp2 13890 1 (𝜑 → (𝑈 ∈ Grp ∧ (𝐹0 ) = (0g𝑈)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1009   = wceq 1402  wcel 2209  ontowfo 5370  cfv 5372  (class class class)co 6075  Basecbs 13330  +gcplusg 13408  0gc0g 13587  s cimas 13599  Grpcgrp 13782  invgcminusg 13783
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-tp 3713  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-mulr 13422  df-0g 13589  df-iimas 13601  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785  df-minusg 13786
This theorem is referenced by:  imasgrpf1  13892  imasabl  14117  imasring  14342
  Copyright terms: Public domain W3C validator