Theorem dprdf 20050

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 20041	. . . . . 6 ⊢ Rel dom DProd
2	1	brrelex2i 5757	. . . . 5 ⊢ (𝐺dom DProd 𝑆 → 𝑆 ∈ V)
3	2	dmexd 7943	. . . 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‘𝐺))
8	5, 6, 7	dmdprd 20042	. . . 4 ⊢ ((dom 𝑆 ∈ V ∧ dom 𝑆 = dom 𝑆) → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g‘𝐺)}))))
9	3, 4, 8	sylancl 585	. . 3 ⊢ (𝐺dom DProd 𝑆 → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g‘𝐺)}))))
10	9	ibi 267	. 2 ⊢ (𝐺dom DProd 𝑆 → (𝐺 ∈ Grp ∧ 𝑆:dom 𝑆⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ dom 𝑆(∀𝑦 ∈ (dom 𝑆 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (dom 𝑆 ∖ {𝑥})))) = {(0g‘𝐺)})))
11	10	simp2d 1143	1 ⊢ (𝐺dom DProd 𝑆 → 𝑆:dom 𝑆⟶(SubGrp‘𝐺))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067  Vcvv 3488   ∖ cdif 3973   ∩ cin 3975   ⊆ wss 3976  {csn 4648  ∪ cuni 4931   class class class wbr 5166  dom cdm 5700   “ cima 5703  ⟶wf 6569  ‘cfv 6573  0_gc0g 17499  mrClscmrc 17641  Grpcgrp 18973  SubGrpcsubg 19160  Cntzccntz 19355   DProd cdprd 20037

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-ixp 8956  df-dprd 20039

This theorem is referenced by:  dprdf2  20051  dprdsubg  20068  dprdspan  20071  subgdprd  20079  ablfaclem2  20130  ablfac2  20133