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

Theorem subgsub 13597
Description: The subtraction of elements in a subgroup is the same as subtraction in the group. (Contributed by Mario Carneiro, 15-Jun-2015.)
Hypotheses
Ref Expression
subgsubcl.p = (-g𝐺)
subgsub.h 𝐻 = (𝐺s 𝑆)
subgsub.n 𝑁 = (-g𝐻)
Assertion
Ref Expression
subgsub ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋 𝑌) = (𝑋𝑁𝑌))

Proof of Theorem subgsub
StepHypRef Expression
1 subgsub.h . . . . . 6 𝐻 = (𝐺s 𝑆)
21a1i 9 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐻 = (𝐺s 𝑆))
3 eqidd 2207 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐺))
4 id 19 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
5 subgrcl 13590 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
62, 3, 4, 5ressplusgd 13036 . . . 4 (𝑆 ∈ (SubGrp‘𝐺) → (+g𝐺) = (+g𝐻))
763ad2ant1 1021 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (+g𝐺) = (+g𝐻))
8 eqidd 2207 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋 = 𝑋)
9 eqid 2206 . . . . 5 (invg𝐺) = (invg𝐺)
10 eqid 2206 . . . . 5 (invg𝐻) = (invg𝐻)
111, 9, 10subginv 13592 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑌𝑆) → ((invg𝐺)‘𝑌) = ((invg𝐻)‘𝑌))
12113adant2 1019 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → ((invg𝐺)‘𝑌) = ((invg𝐻)‘𝑌))
137, 8, 12oveq123d 5978 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋(+g𝐺)((invg𝐺)‘𝑌)) = (𝑋(+g𝐻)((invg𝐻)‘𝑌)))
14 eqid 2206 . . . . . 6 (Base‘𝐺) = (Base‘𝐺)
1514subgss 13585 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
16153ad2ant1 1021 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑆 ⊆ (Base‘𝐺))
17 simp2 1001 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋𝑆)
1816, 17sseldd 3198 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ∈ (Base‘𝐺))
19 simp3 1002 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑌𝑆)
2016, 19sseldd 3198 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ∈ (Base‘𝐺))
21 eqid 2206 . . . 4 (+g𝐺) = (+g𝐺)
22 subgsubcl.p . . . 4 = (-g𝐺)
2314, 21, 9, 22grpsubval 13453 . . 3 ((𝑋 ∈ (Base‘𝐺) ∧ 𝑌 ∈ (Base‘𝐺)) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
2418, 20, 23syl2anc 411 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋 𝑌) = (𝑋(+g𝐺)((invg𝐺)‘𝑌)))
251subgbas 13589 . . . . 5 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘𝐻))
26253ad2ant1 1021 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑆 = (Base‘𝐻))
2717, 26eleqtrd 2285 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ∈ (Base‘𝐻))
2819, 26eleqtrd 2285 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ∈ (Base‘𝐻))
29 eqid 2206 . . . 4 (Base‘𝐻) = (Base‘𝐻)
30 eqid 2206 . . . 4 (+g𝐻) = (+g𝐻)
31 subgsub.n . . . 4 𝑁 = (-g𝐻)
3229, 30, 10, 31grpsubval 13453 . . 3 ((𝑋 ∈ (Base‘𝐻) ∧ 𝑌 ∈ (Base‘𝐻)) → (𝑋𝑁𝑌) = (𝑋(+g𝐻)((invg𝐻)‘𝑌)))
3327, 28, 32syl2anc 411 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋𝑁𝑌) = (𝑋(+g𝐻)((invg𝐻)‘𝑌)))
3413, 24, 333eqtr4d 2249 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋𝑆𝑌𝑆) → (𝑋 𝑌) = (𝑋𝑁𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 981   = wceq 1373  wcel 2177  wss 3170  cfv 5280  (class class class)co 5957  Basecbs 12907  s cress 12908  +gcplusg 12984  Grpcgrp 13407  invgcminusg 13408  -gcsg 13409  SubGrpcsubg 13578
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 2179  ax-14 2180  ax-ext 2188  ax-coll 4167  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-un 4488  ax-setind 4593  ax-cnex 8036  ax-resscn 8037  ax-1cn 8038  ax-1re 8039  ax-icn 8040  ax-addcl 8041  ax-addrcl 8042  ax-mulcl 8043  ax-addcom 8045  ax-addass 8047  ax-i2m1 8050  ax-0lt1 8051  ax-0id 8053  ax-rnegex 8054  ax-pre-ltirr 8057  ax-pre-ltadd 8061
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 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-int 3892  df-iun 3935  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fun 5282  df-fn 5283  df-f 5284  df-f1 5285  df-fo 5286  df-f1o 5287  df-fv 5288  df-riota 5912  df-ov 5960  df-oprab 5961  df-mpo 5962  df-1st 6239  df-2nd 6240  df-pnf 8129  df-mnf 8130  df-ltxr 8132  df-inn 9057  df-2 9115  df-ndx 12910  df-slot 12911  df-base 12913  df-sets 12914  df-iress 12915  df-plusg 12997  df-0g 13165  df-mgm 13263  df-sgrp 13309  df-mnd 13324  df-grp 13410  df-minusg 13411  df-sbg 13412  df-subg 13581
This theorem is referenced by:  zringsubgval  14442  zndvds  14486
  Copyright terms: Public domain W3C validator