Theorem intxpd 49864

Description: Intersection of Cartesian products is the Cartesian product of intersection of domains and ranges. See also inxp 5805 and iinxp 49863. (Contributed by Zhi Wang, 30-Oct-2025.)

Hypotheses

Ref	Expression
intxpd.1	⊢ (𝜑 → 𝐴 ≠ ∅)
intxpd.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 = (dom 𝑥 × ran 𝑥))
intxpd.3	⊢ 𝑋 = ∩ 𝑥 ∈ 𝐴 dom 𝑥
intxpd.4	⊢ 𝑌 = ∩ 𝑥 ∈ 𝐴 ran 𝑥

Assertion

Ref	Expression
intxpd	⊢ (𝜑 → ∩ 𝐴 = (𝑋 × 𝑌))

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Allowed substitution hints:   𝑋(𝑥)   𝑌(𝑥)

Proof of Theorem intxpd

Step	Hyp	Ref	Expression
1		intiin 5017	. . . 4 ⊢ ∩ 𝐴 = ∩ 𝑥 ∈ 𝐴 𝑥
2		intxpd.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 = (dom 𝑥 × ran 𝑥))
3	2	iineq2dv 4976	. . . 4 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝑥 = ∩ 𝑥 ∈ 𝐴 (dom 𝑥 × ran 𝑥))
4	1, 3	eqtrid 2807	. . 3 ⊢ (𝜑 → ∩ 𝐴 = ∩ 𝑥 ∈ 𝐴 (dom 𝑥 × ran 𝑥))
5		intxpd.1	. . . 4 ⊢ (𝜑 → 𝐴 ≠ ∅)
6		iinxp 49863	. . . 4 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 (dom 𝑥 × ran 𝑥) = (∩ 𝑥 ∈ 𝐴 dom 𝑥 × ∩ 𝑥 ∈ 𝐴 ran 𝑥))
7	5, 6	syl 18	. . 3 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 (dom 𝑥 × ran 𝑥) = (∩ 𝑥 ∈ 𝐴 dom 𝑥 × ∩ 𝑥 ∈ 𝐴 ran 𝑥))
8	4, 7	eqtrd 2795	. 2 ⊢ (𝜑 → ∩ 𝐴 = (∩ 𝑥 ∈ 𝐴 dom 𝑥 × ∩ 𝑥 ∈ 𝐴 ran 𝑥))
9		intxpd.3	. . 3 ⊢ 𝑋 = ∩ 𝑥 ∈ 𝐴 dom 𝑥
10		intxpd.4	. . 3 ⊢ 𝑌 = ∩ 𝑥 ∈ 𝐴 ran 𝑥
11	9, 10	xpeq12i 5675	. 2 ⊢ (𝑋 × 𝑌) = (∩ 𝑥 ∈ 𝐴 dom 𝑥 × ∩ 𝑥 ∈ 𝐴 ran 𝑥)
12	8, 11	eqtr4di 2813	1 ⊢ (𝜑 → ∩ 𝐴 = (𝑋 × 𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∅c0 4278  ∩ cint 4906  ∩ ciin 4951   × cxp 5645  dom cdm 5647  ran crn 5648

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-ext 2732  ax-sep 5248  ax-pr 5390

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-int 4907  df-iin 4953  df-opab 5167  df-xp 5653  df-rel 5654

This theorem is used by: (None)