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

Theorem grpissubg 13059
Description: If the base set of a group is contained in the base set of another group, and the group operation of the group is the restriction of the group operation of the other group to its base set, then the (base set of the) group is subgroup of the other group. (Contributed by AV, 14-Mar-2019.)
Hypotheses
Ref Expression
grpissubg.b 𝐵 = (Base‘𝐺)
grpissubg.s 𝑆 = (Base‘𝐻)
Assertion
Ref Expression
grpissubg ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubGrp‘𝐺)))

Proof of Theorem grpissubg
Dummy variables 𝑎 𝑏 𝑥 𝑦 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 109 . . . 4 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆𝐵)
21adantl 277 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆𝐵)
3 grpissubg.s . . . . . 6 𝑆 = (Base‘𝐻)
4 eqid 2177 . . . . . 6 (0g𝐻) = (0g𝐻)
53, 4grpidcl 12909 . . . . 5 (𝐻 ∈ Grp → (0g𝐻) ∈ 𝑆)
6 elex2 2755 . . . . 5 ((0g𝐻) ∈ 𝑆 → ∃𝑤 𝑤𝑆)
75, 6syl 14 . . . 4 (𝐻 ∈ Grp → ∃𝑤 𝑤𝑆)
87ad2antlr 489 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∃𝑤 𝑤𝑆)
9 grpmnd 12889 . . . . . . . . . . 11 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
10 mndmgm 12828 . . . . . . . . . . 11 (𝐺 ∈ Mnd → 𝐺 ∈ Mgm)
119, 10syl 14 . . . . . . . . . 10 (𝐺 ∈ Grp → 𝐺 ∈ Mgm)
12 grpmnd 12889 . . . . . . . . . . 11 (𝐻 ∈ Grp → 𝐻 ∈ Mnd)
13 mndmgm 12828 . . . . . . . . . . 11 (𝐻 ∈ Mnd → 𝐻 ∈ Mgm)
1412, 13syl 14 . . . . . . . . . 10 (𝐻 ∈ Grp → 𝐻 ∈ Mgm)
1511, 14anim12i 338 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm))
1615adantr 276 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm))
1716ad2antrr 488 . . . . . . 7 (((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) ∧ 𝑏𝑆) → (𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm))
18 simpr 110 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))))
1918ad2antrr 488 . . . . . . 7 (((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) ∧ 𝑏𝑆) → (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))))
20 simpr 110 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → 𝑎𝑆)
2120anim1i 340 . . . . . . 7 (((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) ∧ 𝑏𝑆) → (𝑎𝑆𝑏𝑆))
22 grpissubg.b . . . . . . . 8 𝐵 = (Base‘𝐺)
2322, 3mgmsscl 12785 . . . . . . 7 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
2417, 19, 21, 23syl3anc 1238 . . . . . 6 (((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) ∧ 𝑏𝑆) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
2524ralrimiva 2550 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆)
26 simpl 109 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → 𝐺 ∈ Grp)
2726adantr 276 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝐺 ∈ Grp)
28 simplr 528 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝐻 ∈ Grp)
2922sseq2i 3184 . . . . . . . . . . 11 (𝑆𝐵𝑆 ⊆ (Base‘𝐺))
3029biimpi 120 . . . . . . . . . 10 (𝑆𝐵𝑆 ⊆ (Base‘𝐺))
3130adantr 276 . . . . . . . . 9 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ⊆ (Base‘𝐺))
3231adantl 277 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ⊆ (Base‘𝐺))
33 ovres 6016 . . . . . . . . . . 11 ((𝑥𝑆𝑦𝑆) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐺)𝑦))
3433adantl 277 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐺)𝑦))
35 oveq 5883 . . . . . . . . . . . . 13 ((+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)) → (𝑥(+g𝐻)𝑦) = (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦))
3635adantl 277 . . . . . . . . . . . 12 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑥(+g𝐻)𝑦) = (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦))
3736eqcomd 2183 . . . . . . . . . . 11 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐻)𝑦))
3837ad2antlr 489 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐻)𝑦))
3934, 38eqtr3d 2212 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
4039ralrimivva 2559 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
4127, 28, 3, 32, 40grpinvssd 12952 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑎𝑆 → ((invg𝐻)‘𝑎) = ((invg𝐺)‘𝑎)))
4241imp 124 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) = ((invg𝐺)‘𝑎))
43 eqid 2177 . . . . . . . 8 (invg𝐻) = (invg𝐻)
443, 43grpinvcl 12926 . . . . . . 7 ((𝐻 ∈ Grp ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) ∈ 𝑆)
4544ad4ant24 516 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) ∈ 𝑆)
4642, 45eqeltrrd 2255 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐺)‘𝑎) ∈ 𝑆)
4725, 46jca 306 . . . 4 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))
4847ralrimiva 2550 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))
49 eqid 2177 . . . . 5 (+g𝐺) = (+g𝐺)
50 eqid 2177 . . . . 5 (invg𝐺) = (invg𝐺)
5122, 49, 50issubg2m 13054 . . . 4 (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆𝐵 ∧ ∃𝑤 𝑤𝑆 ∧ ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))))
5251ad2antrr 488 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆𝐵 ∧ ∃𝑤 𝑤𝑆 ∧ ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))))
532, 8, 48, 52mpbir3and 1180 . 2 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ∈ (SubGrp‘𝐺))
5453ex 115 1 ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubGrp‘𝐺)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 978   = wceq 1353  wex 1492  wcel 2148  wral 2455  wss 3131   × cxp 4626  cres 4630  cfv 5218  (class class class)co 5877  Basecbs 12464  +gcplusg 12538  0gc0g 12710  Mgmcmgm 12778  Mndcmnd 12822  Grpcgrp 12882  invgcminusg 12883  SubGrpcsubg 13032
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-pre-ltirr 7925  ax-pre-ltadd 7929
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-ltxr 7999  df-inn 8922  df-2 8980  df-ndx 12467  df-slot 12468  df-base 12470  df-sets 12471  df-iress 12472  df-plusg 12551  df-0g 12712  df-mgm 12780  df-sgrp 12813  df-mnd 12823  df-grp 12885  df-minusg 12886  df-subg 13035
This theorem is referenced by:  resgrpisgrp  13060
  Copyright terms: Public domain W3C validator