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

Theorem grpressid 13667
Description: A group restricted to its base set is a group. It will usually be the original group exactly, of course, but to show that needs additional conditions such as those in strressid 13177. (Contributed by Jim Kingdon, 28-Feb-2025.)
Hypothesis
Ref Expression
grpressid.b 𝐵 = (Base‘𝐺)
Assertion
Ref Expression
grpressid (𝐺 ∈ Grp → (𝐺s 𝐵) ∈ Grp)

Proof of Theorem grpressid
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inidm 3415 . . 3 (𝐵𝐵) = 𝐵
2 eqidd 2231 . . . 4 (𝐺 ∈ Grp → (𝐺s 𝐵) = (𝐺s 𝐵))
3 grpressid.b . . . . 5 𝐵 = (Base‘𝐺)
43a1i 9 . . . 4 (𝐺 ∈ Grp → 𝐵 = (Base‘𝐺))
5 id 19 . . . 4 (𝐺 ∈ Grp → 𝐺 ∈ Grp)
6 basfn 13164 . . . . . 6 Base Fn V
7 elex 2813 . . . . . 6 (𝐺 ∈ Grp → 𝐺 ∈ V)
8 funfvex 5659 . . . . . . 7 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
98funfni 5434 . . . . . 6 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
106, 7, 9sylancr 414 . . . . 5 (𝐺 ∈ Grp → (Base‘𝐺) ∈ V)
113, 10eqeltrid 2317 . . . 4 (𝐺 ∈ Grp → 𝐵 ∈ V)
122, 4, 5, 11ressbasd 13173 . . 3 (𝐺 ∈ Grp → (𝐵𝐵) = (Base‘(𝐺s 𝐵)))
131, 12eqtr3id 2277 . 2 (𝐺 ∈ Grp → 𝐵 = (Base‘(𝐺s 𝐵)))
14 eqidd 2231 . . 3 (𝐺 ∈ Grp → (+g𝐺) = (+g𝐺))
152, 14, 11, 7ressplusgd 13235 . 2 (𝐺 ∈ Grp → (+g𝐺) = (+g‘(𝐺s 𝐵)))
16 eqid 2230 . . 3 (+g𝐺) = (+g𝐺)
173, 16grpcl 13614 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵𝑦𝐵) → (𝑥(+g𝐺)𝑦) ∈ 𝐵)
183, 16grpass 13615 . 2 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧)))
19 eqid 2230 . . 3 (0g𝐺) = (0g𝐺)
203, 19grpidcl 13635 . 2 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝐵)
213, 16, 19grplid 13637 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((0g𝐺)(+g𝐺)𝑥) = 𝑥)
22 eqid 2230 . . 3 (invg𝐺) = (invg𝐺)
233, 22grpinvcl 13654 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((invg𝐺)‘𝑥) ∈ 𝐵)
243, 16, 19, 22grplinv 13656 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (((invg𝐺)‘𝑥)(+g𝐺)𝑥) = (0g𝐺))
2513, 15, 17, 18, 20, 21, 23, 24isgrpd 13629 1 (𝐺 ∈ Grp → (𝐺s 𝐵) ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1397  wcel 2201  Vcvv 2801  cin 3198   Fn wfn 5323  cfv 5328  (class class class)co 6023  Basecbs 13105  s cress 13106  +gcplusg 13183  0gc0g 13362  Grpcgrp 13606  invgcminusg 13607
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-addass 8139  ax-i2m1 8142  ax-0lt1 8143  ax-0id 8145  ax-rnegex 8146  ax-pre-ltirr 8149  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-pnf 8221  df-mnf 8222  df-ltxr 8224  df-inn 9149  df-2 9207  df-ndx 13108  df-slot 13109  df-base 13111  df-sets 13112  df-iress 13113  df-plusg 13196  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-grp 13609  df-minusg 13610
This theorem is referenced by:  subgid  13785  ablressid  13945  ringressid  14100
  Copyright terms: Public domain W3C validator