Theorem eldprdi 20096

Description: The domain of definition of the internal direct product, which states that 𝑆 is a family of subgroups that mutually commute and have trivial intersections. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 14-Jul-2019.)

Hypotheses

Ref	Expression
eldprdi.0	⊢ 0 = (0g‘𝐺)
eldprdi.w	⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 }
eldprdi.1	⊢ (𝜑 → 𝐺dom DProd 𝑆)
eldprdi.2	⊢ (𝜑 → dom 𝑆 = 𝐼)
eldprdi.3	⊢ (𝜑 → 𝐹 ∈ 𝑊)

Assertion

Ref	Expression
eldprdi	⊢ (𝜑 → (𝐺 Σg 𝐹) ∈ (𝐺 DProd 𝑆))

Distinct variable groups:   ℎ,𝐹   ℎ,𝑖,𝐺   ℎ,𝐼,𝑖   0 ,ℎ   𝑆,ℎ,𝑖

Allowed substitution hints:   𝜑(ℎ, 𝑖)   𝐹(𝑖)   𝑊(ℎ, 𝑖)   0 (𝑖)

Proof of Theorem eldprdi

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldprdi.1	. 2 ⊢ (𝜑 → 𝐺dom DProd 𝑆)
2		eldprdi.3	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑊)
3		eqid 2762	. . 3 ⊢ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐹)
4		oveq2 7420	. . . 4 ⊢ (𝑓 = 𝐹 → (𝐺 Σg 𝑓) = (𝐺 Σg 𝐹))
5	4	rspceeqv 3603	. . 3 ⊢ ((𝐹 ∈ 𝑊 ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐹)) → ∃𝑓 ∈ 𝑊 (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))
6	2, 3, 5	sylancl 597	. 2 ⊢ (𝜑 → ∃𝑓 ∈ 𝑊 (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))
7		eldprdi.2	. . 3 ⊢ (𝜑 → dom 𝑆 = 𝐼)
8		eldprdi.0	. . . 4 ⊢ 0 = (0g‘𝐺)
9		eldprdi.w	. . . 4 ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 }
10	8, 9	eldprd 20082	. . 3 ⊢ (dom 𝑆 = 𝐼 → ((𝐺 Σg 𝐹) ∈ (𝐺 DProd 𝑆) ↔ (𝐺dom DProd 𝑆 ∧ ∃𝑓 ∈ 𝑊 (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
11	7, 10	syl 18	. 2 ⊢ (𝜑 → ((𝐺 Σg 𝐹) ∈ (𝐺 DProd 𝑆) ↔ (𝐺dom DProd 𝑆 ∧ ∃𝑓 ∈ 𝑊 (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
12	1, 6, 11	mpbir2and 725	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) ∈ (𝐺 DProd 𝑆))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∃wrex 3088  {crab 3415   class class class wbr 5108  dom cdm 5660  ‘cfv 6536  (class class class)co 7412  Xcixp 8893   finSupp cfsupp 9319  0_gc0g 17498   Σ_g cgsu 17499   DProd cdprd 20071

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-ixp 8894  df-dprd 20073

This theorem is used by:  dprdfsub  20099  dprdf11  20101  dprdsubg  20102  dprdub  20103  dpjidcl  20136