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

Theorem grpissubg 13501
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 2204 . . . . . 6 (0g𝐻) = (0g𝐻)
53, 4grpidcl 13332 . . . . 5 (𝐻 ∈ Grp → (0g𝐻) ∈ 𝑆)
6 elex2 2787 . . . . 5 ((0g𝐻) ∈ 𝑆 → ∃𝑤 𝑤𝑆)
75, 6syl 14 . . . 4 (𝐻 ∈ Grp → ∃𝑤 𝑤𝑆)
87ad2antlr 489 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∃𝑤 𝑤𝑆)
9 grpmnd 13310 . . . . . . . . . . 11 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
10 mndmgm 13225 . . . . . . . . . . 11 (𝐺 ∈ Mnd → 𝐺 ∈ Mgm)
119, 10syl 14 . . . . . . . . . 10 (𝐺 ∈ Grp → 𝐺 ∈ Mgm)
12 grpmnd 13310 . . . . . . . . . . 11 (𝐻 ∈ Grp → 𝐻 ∈ Mnd)
13 mndmgm 13225 . . . . . . . . . . 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 13164 . . . . . . 7 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑎𝑆𝑏𝑆)) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
2417, 19, 21, 23syl3anc 1249 . . . . . 6 (((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) ∧ 𝑏𝑆) → (𝑎(+g𝐺)𝑏) ∈ 𝑆)
2524ralrimiva 2578 . . . . 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 3219 . . . . . . . . . . 11 (𝑆𝐵𝑆 ⊆ (Base‘𝐺))
3029biimpi 120 . . . . . . . . . 10 (𝑆𝐵𝑆 ⊆ (Base‘𝐺))
3130adantr 276 . . . . . . . . 9 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ⊆ (Base‘𝐺))
3231adantl 277 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ⊆ (Base‘𝐺))
33 ovres 6085 . . . . . . . . . . 11 ((𝑥𝑆𝑦𝑆) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐺)𝑦))
3433adantl 277 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐺)𝑦))
35 oveq 5949 . . . . . . . . . . . . 13 ((+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)) → (𝑥(+g𝐻)𝑦) = (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦))
3635adantl 277 . . . . . . . . . . . 12 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑥(+g𝐻)𝑦) = (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦))
3736eqcomd 2210 . . . . . . . . . . 11 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐻)𝑦))
3837ad2antlr 489 . . . . . . . . . 10 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥((+g𝐺) ↾ (𝑆 × 𝑆))𝑦) = (𝑥(+g𝐻)𝑦))
3934, 38eqtr3d 2239 . . . . . . . . 9 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
4039ralrimivva 2587 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
4127, 28, 3, 32, 40grpinvssd 13380 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑎𝑆 → ((invg𝐻)‘𝑎) = ((invg𝐺)‘𝑎)))
4241imp 124 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) = ((invg𝐺)‘𝑎))
43 eqid 2204 . . . . . . . 8 (invg𝐻) = (invg𝐻)
443, 43grpinvcl 13351 . . . . . . 7 ((𝐻 ∈ Grp ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) ∈ 𝑆)
4544ad4ant24 516 . . . . . 6 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐻)‘𝑎) ∈ 𝑆)
4642, 45eqeltrrd 2282 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → ((invg𝐺)‘𝑎) ∈ 𝑆)
4725, 46jca 306 . . . 4 ((((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) ∧ 𝑎𝑆) → (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))
4847ralrimiva 2578 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))
49 eqid 2204 . . . . 5 (+g𝐺) = (+g𝐺)
50 eqid 2204 . . . . 5 (invg𝐺) = (invg𝐺)
5122, 49, 50issubg2m 13496 . . . 4 (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆𝐵 ∧ ∃𝑤 𝑤𝑆 ∧ ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))))
5251ad2antrr 488 . . 3 (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)))) → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝑆𝐵 ∧ ∃𝑤 𝑤𝑆 ∧ ∀𝑎𝑆 (∀𝑏𝑆 (𝑎(+g𝐺)𝑏) ∈ 𝑆 ∧ ((invg𝐺)‘𝑎) ∈ 𝑆))))
532, 8, 48, 52mpbir3and 1182 . 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 980   = wceq 1372  wex 1514  wcel 2175  wral 2483  wss 3165   × cxp 4672  cres 4676  cfv 5270  (class class class)co 5943  Basecbs 12803  +gcplusg 12880  0gc0g 13059  Mgmcmgm 13157  Mndcmnd 13219  Grpcgrp 13303  invgcminusg 13304  SubGrpcsubg 13474
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-addcom 8024  ax-addass 8026  ax-i2m1 8029  ax-0lt1 8030  ax-0id 8032  ax-rnegex 8033  ax-pre-ltirr 8036  ax-pre-ltadd 8040
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-reu 2490  df-rmo 2491  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-pnf 8108  df-mnf 8109  df-ltxr 8111  df-inn 9036  df-2 9094  df-ndx 12806  df-slot 12807  df-base 12809  df-sets 12810  df-iress 12811  df-plusg 12893  df-0g 13061  df-mgm 13159  df-sgrp 13205  df-mnd 13220  df-grp 13306  df-minusg 13307  df-subg 13477
This theorem is referenced by:  resgrpisgrp  13502
  Copyright terms: Public domain W3C validator