Theorem nfxp 5676

Description: Bound-variable hypothesis builder for Cartesian product. (Contributed by NM, 15-Sep-2003.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
nfxp.1	⊢ Ⅎ𝑥𝐴
nfxp.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
nfxp	⊢ Ⅎ𝑥(𝐴 × 𝐵)

Proof of Theorem nfxp

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-xp 5649	. 2 ⊢ (𝐴 × 𝐵) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)}
2		nfxp.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
3	2	nfcri 2915	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
4		nfxp.2	. . . . 5 ⊢ Ⅎ𝑥𝐵
5	4	nfcri 2915	. . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐵
6	3, 5	nfan 1918	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)
7	6	nfopab 5166	. 2 ⊢ Ⅎ𝑥{⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)}
8	1, 7	nfcxfr 2921	1 ⊢ Ⅎ𝑥(𝐴 × 𝐵)

Syntax hints:   ∧ wa 399   ∈ wcel 2141  Ⅎwnfc 2908  {copab 5159   × cxp 5641

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-opab 5160  df-xp 5649

This theorem is referenced by:  opeliunxp  5710  opeliun2xp  5711  nfres  5963  mpomptsx  8040  dmmpossx  8042  fmpox  8043  ovmptss  8066  nfdju  9859  axcc2  10388  fsum2dlem  15788  fsumcom2  15792  fprod2dlem  16001  fprodcom2  16005  gsumcom2  20006  prdsdsf  24415  prdsxmet  24417  iunxpssiun1  32728  djussxp2  32811  aciunf1lem  32825  gsumpart  33204  esum2dlem  34350  poimirlem16  38096  poimirlem19  38099  dvnprodlem1  46481  stoweidlem21  46556  stoweidlem47  46582  dmmpossx2  48920