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

Theorem grpissubg 13691
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 2207 . . . . . 6 (0g𝐻) = (0g𝐻)
53, 4grpidcl 13522 . . . . 5 (𝐻 ∈ Grp → (0g𝐻) ∈ 𝑆)
6 elex2 2794 . . . . 5 ((0g𝐻) ∈ 𝑆 → ∃𝑤 𝑤𝑆)
75, 6syl 14 . . . 4 (𝐻 ∈ Grp → ∃𝑤 𝑤𝑆)
87ad2antlr 489 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∃𝑤 𝑤𝑆)
9 grpmnd 13500 . . . . . . . . . . 11 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
10 mndmgm 13415 . . . . . . . . . . 11 (𝐺 ∈ Mnd → 𝐺 ∈ Mgm)
119, 10syl 14 . . . . . . . . . 10 (𝐺 ∈ Grp → 𝐺 ∈ Mgm)
12 grpmnd 13500 . . . . . . . . . . 11 (𝐻 ∈ Grp → 𝐻 ∈ Mnd)
13 mndmgm 13415 . . . . . . . . . . 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 13354 . . . . . . 7 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
2417, 19, 21, 23syl3anc 1250 . . . . . 6 (((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) ∧ 𝑏𝑆) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
2524ralrimiva 2581 . . . . 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 3229 . . . . . . . . . . 11 (𝑆𝐵𝑆 ⊆ (Base‘𝐺))
3029biimpi 120 . . . . . . . . . 10 (𝑆𝐵𝑆 ⊆ (Base‘𝐺))
3130adantr 276 . . . . . . . . 9 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ⊆ (Base‘𝐺))
3231adantl 277 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ⊆ (Base‘𝐺))
33 ovres 6111 . . . . . . . . . . 11 ((𝑥𝑆𝑦𝑆) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐺)𝑦))
3433adantl 277 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐺)𝑦))
35 oveq 5975 . . . . . . . . . . . . 13 ((+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)) → (𝑥(+g𝐻)𝑦) = (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦))
3635adantl 277 . . . . . . . . . . . 12 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑥(+g𝐻)𝑦) = (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦))
3736eqcomd 2213 . . . . . . . . . . 11 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐻)𝑦))
3837ad2antlr 489 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐻)𝑦))
3934, 38eqtr3d 2242 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
4039ralrimivva 2590 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
4127, 28, 3, 32, 40grpinvssd 13570 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑎𝑆 → ((invg𝐻)‘𝑎) = ((invg𝐺)‘𝑎)))
4241imp 124 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) = ((invg𝐺)‘𝑎))
43 eqid 2207 . . . . . . . 8 (invg𝐻) = (invg𝐻)
443, 43grpinvcl 13541 . . . . . . 7 ((𝐻 ∈ Grp ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) ∈ 𝑆)
4544ad4ant24 516 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) ∈ 𝑆)
4642, 45eqeltrrd 2285 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐺)‘𝑎) ∈ 𝑆)
4725, 46jca 306 . . . 4 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))
4847ralrimiva 2581 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))
49 eqid 2207 . . . . 5 (+g𝐺) = (+g𝐺)
50 eqid 2207 . . . . 5 (invg𝐺) = (invg𝐺)
5122, 49, 50issubg2m 13686 . . . 4 (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆𝐵 ∧ ∃𝑤 𝑤𝑆 ∧ ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))))
5251ad2antrr 488 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆𝐵 ∧ ∃𝑤 𝑤𝑆 ∧ ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))))
532, 8, 48, 52mpbir3and 1183 . 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 981   = wceq 1373  wex 1516  wcel 2178  wral 2486  wss 3175   × cxp 4692  cres 4696  cfv 5291  (class class class)co 5969  Basecbs 12993  +gcplusg 13070  0gc0g 13249  Mgmcmgm 13347  Mndcmnd 13409  Grpcgrp 13493  invgcminusg 13494  SubGrpcsubg 13664
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 2180  ax-14 2181  ax-ext 2189  ax-coll 4176  ax-sep 4179  ax-pow 4235  ax-pr 4270  ax-un 4499  ax-setind 4604  ax-cnex 8053  ax-resscn 8054  ax-1cn 8055  ax-1re 8056  ax-icn 8057  ax-addcl 8058  ax-addrcl 8059  ax-mulcl 8060  ax-addcom 8062  ax-addass 8064  ax-i2m1 8067  ax-0lt1 8068  ax-0id 8070  ax-rnegex 8071  ax-pre-ltirr 8074  ax-pre-ltadd 8078
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2779  df-sbc 3007  df-csb 3103  df-dif 3177  df-un 3179  df-in 3181  df-ss 3188  df-nul 3470  df-pw 3629  df-sn 3650  df-pr 3651  df-op 3653  df-uni 3866  df-int 3901  df-iun 3944  df-br 4061  df-opab 4123  df-mpt 4124  df-id 4359  df-xp 4700  df-rel 4701  df-cnv 4702  df-co 4703  df-dm 4704  df-rn 4705  df-res 4706  df-ima 4707  df-iota 5252  df-fun 5293  df-fn 5294  df-f 5295  df-f1 5296  df-fo 5297  df-f1o 5298  df-fv 5299  df-riota 5924  df-ov 5972  df-oprab 5973  df-mpo 5974  df-pnf 8146  df-mnf 8147  df-ltxr 8149  df-inn 9074  df-2 9132  df-ndx 12996  df-slot 12997  df-base 12999  df-sets 13000  df-iress 13001  df-plusg 13083  df-0g 13251  df-mgm 13349  df-sgrp 13395  df-mnd 13410  df-grp 13496  df-minusg 13497  df-subg 13667
This theorem is referenced by:  resgrpisgrp  13692
  Copyright terms: Public domain W3C validator