Theorem dprdf 20031

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.

Step	Hyp	Ref	Expression
1		reldmdprd 20022	. . . . . 6 ⊢ Rel dom DProd
2	1	brrelex2i 5702	. . . . 5 ⊢ (𝐺dom DProd 𝑆 → 𝑆 ∈ V)
3	2	dmexd 7880	. . . 4 ⊢ (𝐺dom DProd 𝑆 → dom 𝑆 ∈ V)
4		eqid 2761	. . . 4 ⊢ dom 𝑆 = dom 𝑆
5		eqid 2761	. . . . 5 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
6		eqid 2761	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
7		eqid 2761	. . . . 5 ⊢ (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
8	5, 6, 7	dmdprd 20023	. . . 4 ⊢ ((dom 𝑆 ∈ V ∧ dom 𝑆 = dom 𝑆) → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g‘𝐺)}))))
9	3, 4, 8	sylancl 595	. . 3 ⊢ (𝐺dom DProd 𝑆 → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g‘𝐺)}))))
10	9	ibi 269	. 2 ⊢ (𝐺dom DProd 𝑆 → (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g‘𝐺)})))
11	10	simp2d 1155	1 ⊢ (𝐺dom DProd 𝑆 → 𝑆:dom 𝑆⟶(SubGrp‘𝐺))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  Vcvv 3453   ∖ cdif 3901   ∩ cin 3903   ⊆ wss 3904  {csn 4581  ∪ cuni 4864   class class class wbr 5099  dom cdm 5645   “ cima 5648  ⟶wf 6513  ‘cfv 6517  0_gc0g 17451  mrClscmrc 17594  Grpcgrp 18958  SubGrpcsubg 19145  Cntzccntz 19338   DProd cdprd 20018

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-oprab 7396  df-mpo 7397  df-1st 7966  df-2nd 7967  df-ixp 8876  df-dprd 20020

This theorem is referenced by:  dprdf2  20032  dprdsubg  20049  dprdspan  20052  subgdprd  20060  ablfaclem2  20111  ablfac2  20114