Theorem ixpintm 6959

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 6946	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 𝑦 → X𝑥 ∈ 𝐴 ∩ 𝐵 = X𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝑦)
2		intiin 4045	. . . 4 ⊢ ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 𝑦
3	2	a1i 9	. . 3 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 𝑦)
4	1, 3	mprg 2599	. 2 ⊢ X𝑥 ∈ 𝐴 ∩ 𝐵 = X𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝑦
5		ixpiinm 6958	. 2 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → X𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝑦 = ∩ 𝑦 ∈ 𝐵 X𝑥 ∈ 𝐴 𝑦)
6	4, 5	eqtrid 2277	1 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → X𝑥 ∈ 𝐴 ∩ 𝐵 = ∩ 𝑦 ∈ 𝐵 X𝑥 ∈ 𝐴 𝑦)

Syntax hints:   → wi 4   = wceq 1398  ∃wex 1541   ∈ wcel 2203  ∩ cint 3948  ∩ ciin 3991  Xcixp 6932

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iin 3993  df-br 4109  df-opab 4171  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-iota 5311  df-fun 5353  df-fn 5354  df-fv 5359  df-ixp 6933

This theorem is referenced by: (None)