Theorem eldprdi 20148

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 7424	. . . 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 20134	. . 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 2145  ∃wrex 3088  {crab 3414   class class class wbr 5107  dom cdm 5659  ‘cfv 6537  (class class class)co 7416  Xcixp 8907   finSupp cfsupp 9334  0_gc0g 17528   Σ_g cgsu 17529   DProd cdprd 20123

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-ixp 8908  df-dprd 20125

This theorem is used by:  dprdfsub  20151  dprdf11  20153  dprdsubg  20154  dprdub  20155  dpjidcl  20188