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

Theorem dprdf 19981
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 19972 . . . . . 6 Rel dom DProd
21brrelex2i 5682 . . . . 5 (𝐺dom DProd 𝑆𝑆 ∈ V)
32dmexd 7850 . . . 4 (𝐺dom DProd 𝑆 → dom 𝑆 ∈ V)
4 eqid 2740 . . . 4 dom 𝑆 = dom 𝑆
5 eqid 2740 . . . . 5 (Cntz‘𝐺) = (Cntz‘𝐺)
6 eqid 2740 . . . . 5 (0g𝐺) = (0g𝐺)
7 eqid 2740 . . . . 5 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
85, 6, 7dmdprd 19973 . . . 4 ((dom 𝑆 ∈ V ∧ dom 𝑆 = dom 𝑆) → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)) ∧ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g𝐺)}))))
93, 4, 8sylancl 592 . . 3 (𝐺dom DProd 𝑆 → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)) ∧ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g𝐺)}))))
109ibi 268 . 2 (𝐺dom DProd 𝑆 → (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)) ∧ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g𝐺)})))
1110simp2d 1149 1 (𝐺dom DProd 𝑆𝑆:dom 𝑆⟶(SubGrp‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3054  Vcvv 3432  cdif 3887  cin 3889  wss 3890  {csn 4562   cuni 4845   class class class wbr 5079  dom cdm 5625  cima 5628  wf 6488  cfv 6492  0gc0g 17400  mrClscmrc 17543  Grpcgrp 18907  SubGrpcsubg 19094  Cntzccntz 19288   DProd cdprd 19968
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-ixp 8843  df-dprd 19970
This theorem is referenced by:  dprdf2  19982  dprdsubg  19999  dprdspan  20002  subgdprd  20010  ablfaclem2  20061  ablfac2  20064
  Copyright terms: Public domain W3C validator