Theorem eldprdi 20100

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 2766	. . 3 ⊢ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐹)
4		oveq2 7424	. . . 4 ⊢ (𝑓 = 𝐹 → (𝐺 Σg 𝑓) = (𝐺 Σg 𝐹))
5	4	rspceeqv 3607	. . 3 ⊢ ((𝐹 ∈ 𝑊 ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐹)) → ∃𝑓 ∈ 𝑊 (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))
6	2, 3, 5	sylancl 598	. 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 20086	. . 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 726	1 ⊢ (𝜑 → (𝐺 Σg 𝐹) ∈ (𝐺 DProd 𝑆))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃wrex 3092  {crab 3419   class class class wbr 5112  dom cdm 5664  ‘cfv 6540  (class class class)co 7416  Xcixp 8897   finSupp cfsupp 9323  0_gc0g 17502   Σ_g cgsu 17503   DProd cdprd 20075

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5241  ax-sep 5260  ax-nul 5272  ax-pow 5339  ax-pr 5407  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-iun 4961  df-br 5113  df-opab 5177  df-mpt 5196  df-id 5559  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-ixp 8898  df-dprd 20077

This theorem is used by:  dprdfsub  20103  dprdf11  20105  dprdsubg  20106  dprdub  20107  dpjidcl  20140