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

Theorem imasgrp 13522
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 1021 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑅 ∈ Grp)
8 simp2 1001 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥𝑉)
923ad2ant1 1021 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑉 = (Base‘𝑅))
108, 9eleqtrd 2285 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑥 ∈ (Base‘𝑅))
11 simp3 1002 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦𝑉)
1211, 9eleqtrd 2285 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → 𝑦 ∈ (Base‘𝑅))
13 eqid 2206 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
14 eqid 2206 . . . . 5 (+g𝑅) = (+g𝑅)
1513, 14grpcl 13415 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
167, 10, 12, 15syl3anc 1250 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥(+g𝑅)𝑦) ∈ (Base‘𝑅))
1733ad2ant1 1021 . . . 4 ((𝜑𝑥𝑉𝑦𝑉) → + = (+g𝑅))
1817oveqd 5974 . . 3 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
1916, 18, 93eltr4d 2290 . 2 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
206adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑅 ∈ Grp)
21103adant3r3 1217 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 ∈ (Base‘𝑅))
22123adant3r3 1217 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑦 ∈ (Base‘𝑅))
23 simpr3 1008 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧𝑉)
242adantr 276 . . . . . 6 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑉 = (Base‘𝑅))
2523, 24eleqtrd 2285 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 ∈ (Base‘𝑅))
2613, 14grpass 13416 . . . . 5 ((𝑅 ∈ Grp ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
2720, 21, 22, 25, 26syl13anc 1252 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
283adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → + = (+g𝑅))
29183adant3r3 1217 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + 𝑦) = (𝑥(+g𝑅)𝑦))
30 eqidd 2207 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑧 = 𝑧)
3128, 29, 30oveq123d 5978 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g𝑅)𝑦)(+g𝑅)𝑧))
32 eqidd 2207 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑥 = 𝑥)
3328oveqd 5974 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑦 + 𝑧) = (𝑦(+g𝑅)𝑧))
3428, 32, 33oveq123d 5978 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g𝑅)(𝑦(+g𝑅)𝑧)))
3527, 31, 343eqtr4d 2249 . . 3 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
3635fveq2d 5593 . 2 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
37 imasgrp.z . . . . 5 0 = (0g𝑅)
3813, 37grpidcl 13436 . . . 4 (𝑅 ∈ Grp → 0 ∈ (Base‘𝑅))
396, 38syl 14 . . 3 (𝜑0 ∈ (Base‘𝑅))
4039, 2eleqtrrd 2286 . 2 (𝜑0𝑉)
413adantr 276 . . . . 5 ((𝜑𝑥𝑉) → + = (+g𝑅))
4241oveqd 5974 . . . 4 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = ( 0 (+g𝑅)𝑥))
432eleq2d 2276 . . . . . 6 (𝜑 → (𝑥𝑉𝑥 ∈ (Base‘𝑅)))
4443biimpa 296 . . . . 5 ((𝜑𝑥𝑉) → 𝑥 ∈ (Base‘𝑅))
4513, 14, 37grplid 13438 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ( 0 (+g𝑅)𝑥) = 𝑥)
466, 44, 45syl2an2r 595 . . . 4 ((𝜑𝑥𝑉) → ( 0 (+g𝑅)𝑥) = 𝑥)
4742, 46eqtrd 2239 . . 3 ((𝜑𝑥𝑉) → ( 0 + 𝑥) = 𝑥)
4847fveq2d 5593 . 2 ((𝜑𝑥𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹𝑥))
49 eqid 2206 . . . . 5 (invg𝑅) = (invg𝑅)
5013, 49grpinvcl 13455 . . . 4 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
516, 44, 50syl2an2r 595 . . 3 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ (Base‘𝑅))
522adantr 276 . . 3 ((𝜑𝑥𝑉) → 𝑉 = (Base‘𝑅))
5351, 52eleqtrrd 2286 . 2 ((𝜑𝑥𝑉) → ((invg𝑅)‘𝑥) ∈ 𝑉)
5441oveqd 5974 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = (((invg𝑅)‘𝑥)(+g𝑅)𝑥))
5513, 14, 37, 49grplinv 13457 . . . . 5 ((𝑅 ∈ Grp ∧ 𝑥 ∈ (Base‘𝑅)) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
566, 44, 55syl2an2r 595 . . . 4 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥)(+g𝑅)𝑥) = 0 )
5754, 56eqtrd 2239 . . 3 ((𝜑𝑥𝑉) → (((invg𝑅)‘𝑥) + 𝑥) = 0 )
5857fveq2d 5593 . 2 ((𝜑𝑥𝑉) → (𝐹‘(((invg𝑅)‘𝑥) + 𝑥)) = (𝐹0 ))
591, 2, 3, 4, 5, 6, 19, 36, 40, 48, 53, 58imasgrp2 13521 1 (𝜑 → (𝑈 ∈ Grp ∧ (𝐹0 ) = (0g𝑈)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 981   = wceq 1373  wcel 2177  ontowfo 5278  cfv 5280  (class class class)co 5957  Basecbs 12907  +gcplusg 12984  0gc0g 13163  s cimas 13206  Grpcgrp 13407  invgcminusg 13408
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4167  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-addcom 8045  ax-addass 8047  ax-i2m1 8050  ax-0lt1 8051  ax-0id 8053  ax-rnegex 8054  ax-pre-ltirr 8057  ax-pre-lttrn 8059  ax-pre-ltadd 8061
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-pr 3645  df-tp 3646  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-f1 5285  df-fo 5286  df-f1o 5287  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-pnf 8129  df-mnf 8130  df-ltxr 8132  df-inn 9057  df-2 9115  df-3 9116  df-ndx 12910  df-slot 12911  df-base 12913  df-plusg 12997  df-mulr 12998  df-0g 13165  df-iimas 13209  df-mgm 13263  df-sgrp 13309  df-mnd 13324  df-grp 13410  df-minusg 13411
This theorem is referenced by:  imasgrpf1  13523  imasabl  13747  imasring  13901
  Copyright terms: Public domain W3C validator