Theorem ixpintm 6781

Description: The intersection of a collection of infinite Cartesian products. (Contributed by Mario Carneiro, 3-Feb-2015.) (Revised by Jim Kingdon, 15-Feb-2023.)

Assertion

Ref	Expression
ixpintm	⊢ (∃𝑧 𝑧 ∈ 𝐵 → X𝑥 ∈ 𝐴 ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 X𝑥 ∈ 𝐴 𝑦)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝑧,𝐵

Allowed substitution hint:   𝐴(𝑧)

Proof of Theorem ixpintm

Step	Hyp	Ref	Expression
1		ixpeq2 6768	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 𝑦 → X𝑥 ∈ 𝐴 ∩ 𝐵 = X𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝑦)
2		intiin 3968	. . . 4 ⊢ ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 𝑦
3	2	a1i 9	. . 3 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 𝑦)
4	1, 3	mprg 2551	. 2 ⊢ X𝑥 ∈ 𝐴 ∩ 𝐵 = X𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝑦
5		ixpiinm 6780	. 2 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → X𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝑦 = ∩ 𝑦 ∈ 𝐵 X𝑥 ∈ 𝐴 𝑦)
6	4, 5	eqtrid 2238	1 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → X𝑥 ∈ 𝐴 ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 X𝑥 ∈ 𝐴 𝑦)

Syntax hints:   → wi 4   = wceq 1364  ∃wex 1503   ∈ wcel 2164  ∩ cint 3871  ∩ ciin 3914  Xcixp 6754

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iin 3916  df-br 4031  df-opab 4092  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-iota 5216  df-fun 5257  df-fn 5258  df-fv 5263  df-ixp 6755

This theorem is referenced by: (None)