Theorem eldprdi 20261

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 2763	. . 3 ⊢ (𝐺 Σg 𝐹) = (𝐺 Σg 𝐹)
4		oveq2 7448	. . . 4 ⊢ (𝑓 = 𝐹 → (𝐺 Σg 𝑓) = (𝐺 Σg 𝐹))
5	4	rspceeqv 3602	. . 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 20247	. . 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 2147  ∃wrex 3090  {crab 3416   class class class wbr 5106  dom cdm 5655  ‘cfv 6555  (class class class)co 7440  Xcixp 8950   finSupp cfsupp 9378  0_gc0g 17636   Σ_g cgsu 17637   DProd cdprd 20236

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-ixp 8951  df-dprd 20238

This theorem is used by:  dprdfsub  20264  dprdf11  20266  dprdsubg  20267  dprdub  20268  dpjidcl  20301