MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfxp Structured version   Visualization version   GIF version

Theorem nfxp 5683
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.
StepHypRef Expression
1 df-xp 5656 . 2 (𝐴 × 𝐵) = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)}
2 nfxp.1 . . . . 5 Ⅎ𝑥𝐴
32nfcri 2914 . . . 4 Ⅎ𝑥 𝑦 ∈ 𝐴
4 nfxp.2 . . . . 5 Ⅎ𝑥𝐵
54nfcri 2914 . . . 4 Ⅎ𝑥 𝑧 ∈ 𝐵
63, 5nfan 1931 . . 3 Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)
76nfopab 5173 . 2 Ⅎ𝑥{⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)}
81, 7nfcxfr 2920 1 Ⅎ𝑥(𝐴 × 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   ∈ wcel 2144  Ⅎwnfc 2907  {copab 5166   × cxp 5648
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-opab 5167  df-xp 5656
This theorem is used by:  opeliunxp  5717  opeliun2xp  5718  nfres  5972  mpomptsx  8077  dmmpossx  8079  fmpox  8080  ovmptssOLD  8107  nfdju  9993  axcc2  10520  fsum2dlem  15943  fsumcom2  15947  fprod2dlem  16154  fprodcom2  16158  gsumcom2  20196  prdsdsf  24693  prdsxmet  24695  iunxpssiun1  33211  djussxp2  33291  aciunf1lem  33305  gsumpart  33672  esum2dlem  34772  poimirlem16  38661  poimirlem19  38664  dvnprodlem1  47063  stoweidlem21  47138  stoweidlem47  47164  dmmpossx2  49556
  Copyright terms: Public domain W3C validator