MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dprdf Structured version   Visualization version   GIF version

Theorem dprdf 19783
Description: The function 𝑆 is a family of subgroups. (Contributed by Mario Carneiro, 25-Apr-2016.)
Assertion
Ref Expression
dprdf (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))

Proof of Theorem dprdf
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 reldmdprd 19774 . . . . . 6 Rel dom DProd
21brrelex2i 5689 . . . . 5 (𝐺dom DProd 𝑆𝑆 ∈ V)
32dmexd 7841 . . . 4 (𝐺dom DProd 𝑆 → dom 𝑆 ∈ V)
4 eqid 2736 . . . 4 dom 𝑆 = dom 𝑆
5 eqid 2736 . . . . 5 (Cntz‘𝐺) = (Cntz‘𝐺)
6 eqid 2736 . . . . 5 (0g𝐺) = (0g𝐺)
7 eqid 2736 . . . . 5 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
85, 6, 7dmdprd 19775 . . . 4 ((dom 𝑆 ∈ V ∧ dom 𝑆 = dom 𝑆) → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)) ∧ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g𝐺)}))))
93, 4, 8sylancl 586 . . 3 (𝐺dom DProd 𝑆 → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)) ∧ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g𝐺)}))))
109ibi 266 . 2 (𝐺dom DProd 𝑆 → (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)) ∧ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g𝐺)})))
1110simp2d 1143 1 (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3064  Vcvv 3445  cdif 3907  cin 3909  wss 3910  {csn 4586   cuni 4865   class class class wbr 5105  dom cdm 5633  cima 5636  wf 6492  cfv 6496  0gc0g 17320  mrClscmrc 17462  Grpcgrp 18747  SubGrpcsubg 18920  Cntzccntz 19093   DProd cdprd 19770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7671
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-oprab 7360  df-mpo 7361  df-1st 7920  df-2nd 7921  df-ixp 8835  df-dprd 19772
This theorem is referenced by:  dprdf2  19784  dprdsubg  19801  dprdspan  19804  subgdprd  19812  ablfaclem2  19863  ablfac2  19866
  Copyright terms: Public domain W3C validator