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

Theorem grpressid 13795
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 13305. (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 3432 . . 3 (𝐵𝐵) = 𝐵
2 eqidd 2235 . . . 4 (𝐺 ∈ Grp → (𝐺s 𝐵) = (𝐺s 𝐵))
3 grpressid.b . . . . 5 𝐵 = (Base‘𝐺)
43a1i 9 . . . 4 (𝐺 ∈ Grp → 𝐵 = (Base‘𝐺))
5 id 19 . . . 4 (𝐺 ∈ Grp → 𝐺 ∈ Grp)
6 basfn 13292 . . . . . 6 Base Fn V
7 elex 2827 . . . . . 6 (𝐺 ∈ Grp → 𝐺 ∈ V)
8 funfvex 5689 . . . . . . 7 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
98funfni 5460 . . . . . 6 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
106, 7, 9sylancr 414 . . . . 5 (𝐺 ∈ Grp → (Base‘𝐺) ∈ V)
113, 10eqeltrid 2321 . . . 4 (𝐺 ∈ Grp → 𝐵 ∈ V)
122, 4, 5, 11ressbasd 13301 . . 3 (𝐺 ∈ Grp → (𝐵𝐵) = (Base‘(𝐺s 𝐵)))
131, 12eqtr3id 2281 . 2 (𝐺 ∈ Grp → 𝐵 = (Base‘(𝐺s 𝐵)))
14 eqidd 2235 . . 3 (𝐺 ∈ Grp → (+g𝐺) = (+g𝐺))
152, 14, 11, 7ressplusgd 13363 . 2 (𝐺 ∈ Grp → (+g𝐺) = (+g‘(𝐺s 𝐵)))
16 eqid 2234 . . 3 (+g𝐺) = (+g𝐺)
173, 16grpcl 13742 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵𝑦𝐵) → (𝑥(+g𝐺)𝑦) ∈ 𝐵)
183, 16grpass 13743 . 2 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧)))
19 eqid 2234 . . 3 (0g𝐺) = (0g𝐺)
203, 19grpidcl 13763 . 2 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝐵)
213, 16, 19grplid 13765 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((0g𝐺)(+g𝐺)𝑥) = 𝑥)
22 eqid 2234 . . 3 (invg𝐺) = (invg𝐺)
233, 22grpinvcl 13782 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((invg𝐺)‘𝑥) ∈ 𝐵)
243, 16, 19, 22grplinv 13784 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (((invg𝐺)‘𝑥)(+g𝐺)𝑥) = (0g𝐺))
2513, 15, 17, 18, 20, 21, 23, 24isgrpd 13757 1 (𝐺 ∈ Grp → (𝐺s 𝐵) ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2205  Vcvv 2815  cin 3212   Fn wfn 5349  cfv 5354  (class class class)co 6052  Basecbs 13233  s cress 13234  +gcplusg 13311  0gc0g 13490  Grpcgrp 13734  invgcminusg 13735
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8223  ax-resscn 8224  ax-1cn 8225  ax-1re 8226  ax-icn 8227  ax-addcl 8228  ax-addrcl 8229  ax-mulcl 8230  ax-addcom 8232  ax-addass 8234  ax-i2m1 8237  ax-0lt1 8238  ax-0id 8240  ax-rnegex 8241  ax-pre-ltirr 8244  ax-pre-ltadd 8248
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-pnf 8315  df-mnf 8316  df-ltxr 8318  df-inn 9243  df-2 9301  df-ndx 13236  df-slot 13237  df-base 13239  df-sets 13240  df-iress 13241  df-plusg 13324  df-0g 13492  df-mgm 13590  df-sgrp 13636  df-mnd 13651  df-grp 13737  df-minusg 13738
This theorem is referenced by:  subgid  13913  ablressid  14073  ringressid  14228
  Copyright terms: Public domain W3C validator