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

Theorem issubg 13976
Description: The subgroup predicate. (Contributed by Mario Carneiro, 2-Dec-2014.)
Hypothesis
Ref Expression
issubg.b 𝐵 = (Base‘𝐺)
Assertion
Ref Expression
issubg (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ 𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp))

Proof of Theorem issubg
Dummy variables 𝑤 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-subg 13973 . . 3 SubGrp = (𝑤 ∈ Grp ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ (𝑤s 𝑠) ∈ Grp})
21mptrcl 5788 . 2 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
3 simp1 1028 . 2 ((𝐺 ∈ Grp ∧ 𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp) → 𝐺 ∈ Grp)
4 fveq2 5695 . . . . . . . . 9 (𝑤 = 𝐺 → (Base‘𝑤) = (Base‘𝐺))
5 issubg.b . . . . . . . . 9 𝐵 = (Base‘𝐺)
64, 5eqtr4di 2289 . . . . . . . 8 (𝑤 = 𝐺 → (Base‘𝑤) = 𝐵)
76pweqd 3693 . . . . . . 7 (𝑤 = 𝐺 → 𝒫 (Base‘𝑤) = 𝒫 𝐵)
8 oveq1 6092 . . . . . . . 8 (𝑤 = 𝐺 → (𝑤s 𝑠) = (𝐺s 𝑠))
98eleq1d 2307 . . . . . . 7 (𝑤 = 𝐺 → ((𝑤s 𝑠) ∈ Grp ↔ (𝐺s 𝑠) ∈ Grp))
107, 9rabeqbidv 2816 . . . . . 6 (𝑤 = 𝐺 → {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ (𝑤s 𝑠) ∈ Grp} = {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp})
11 id 19 . . . . . 6 (𝐺 ∈ Grp → 𝐺 ∈ Grp)
12 basfn 13411 . . . . . . . . . 10 Base Fn V
13 elex 2833 . . . . . . . . . 10 (𝐺 ∈ Grp → 𝐺 ∈ V)
14 funfvex 5712 . . . . . . . . . . 11 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1514funfni 5483 . . . . . . . . . 10 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
1612, 13, 15sylancr 418 . . . . . . . . 9 (𝐺 ∈ Grp → (Base‘𝐺) ∈ V)
175, 16eqeltrid 2325 . . . . . . . 8 (𝐺 ∈ Grp → 𝐵 ∈ V)
1817pwexd 4318 . . . . . . 7 (𝐺 ∈ Grp → 𝒫 𝐵 ∈ V)
19 rabexg 4279 . . . . . . 7 (𝒫 𝐵 ∈ V → {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp} ∈ V)
2018, 19syl 14 . . . . . 6 (𝐺 ∈ Grp → {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp} ∈ V)
211, 10, 11, 20fvmptd3 5799 . . . . 5 (𝐺 ∈ Grp → (SubGrp‘𝐺) = {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp})
2221eleq2d 2308 . . . 4 (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ 𝑆 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp}))
23 oveq2 6093 . . . . . . 7 (𝑠 = 𝑆 → (𝐺s 𝑠) = (𝐺s 𝑆))
2423eleq1d 2307 . . . . . 6 (𝑠 = 𝑆 → ((𝐺s 𝑠) ∈ Grp ↔ (𝐺s 𝑆) ∈ Grp))
2524elrab 2982 . . . . 5 (𝑆 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp} ↔ (𝑆 ∈ 𝒫 𝐵 ∧ (𝐺s 𝑆) ∈ Grp))
26 elpw2g 4292 . . . . . . 7 (𝐵 ∈ V → (𝑆 ∈ 𝒫 𝐵𝑆𝐵))
2717, 26syl 14 . . . . . 6 (𝐺 ∈ Grp → (𝑆 ∈ 𝒫 𝐵𝑆𝐵))
2827anbi1d 469 . . . . 5 (𝐺 ∈ Grp → ((𝑆 ∈ 𝒫 𝐵 ∧ (𝐺s 𝑆) ∈ Grp) ↔ (𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp)))
2925, 28bitrid 192 . . . 4 (𝐺 ∈ Grp → (𝑆 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ (𝐺s 𝑠) ∈ Grp} ↔ (𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp)))
30 ibar 301 . . . 4 (𝐺 ∈ Grp → ((𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp) ↔ (𝐺 ∈ Grp ∧ (𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp))))
3122, 29, 303bitrd 214 . . 3 (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ (𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp))))
32 3anass 1013 . . 3 ((𝐺 ∈ Grp ∧ 𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp) ↔ (𝐺 ∈ Grp ∧ (𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp)))
3331, 32bitr4di 198 . 2 (𝐺 ∈ Grp → (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ 𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp)))
342, 3, 33pm5.21nii 716 1 (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ 𝑆𝐵 ∧ (𝐺s 𝑆) ∈ Grp))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  {crab 2532  Vcvv 2821  wss 3220  𝒫 cpw 3688   Fn wfn 5372  cfv 5377  (class class class)co 6085  Basecbs 13352  s cress 13353  Grpcgrp 13805  SubGrpcsubg 13970
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-subg 13973
This theorem is used by:  subgss  13977  subgid  13978  subggrp  13980  subgbas  13981  subgrcl  13982  issubg2m  13992  resgrpisgrp  13998  subsubg  14000  opprsubgg  14390  subrngsubg  14512  subrgsubg  14535
  Copyright terms: Public domain W3C validator