ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfixpxy GIF version

Theorem nfixpxy 6804
Description: Bound-variable hypothesis builder for indexed Cartesian product. (Contributed by Mario Carneiro, 15-Oct-2016.) (Revised by Jim Kingdon, 15-Feb-2023.)
Hypotheses
Ref Expression
nfixp.1 𝑦𝐴
nfixp.2 𝑦𝐵
Assertion
Ref Expression
nfixpxy 𝑦X𝑥𝐴 𝐵
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)

Proof of Theorem nfixpxy
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-ixp 6786 . 2 X𝑥𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
2 nfcv 2348 . . . . 5 𝑦𝑧
3 nftru 1489 . . . . . . 7 𝑥
4 nfcvd 2349 . . . . . . . 8 (⊤ → 𝑦𝑥)
5 nfixp.1 . . . . . . . . 9 𝑦𝐴
65a1i 9 . . . . . . . 8 (⊤ → 𝑦𝐴)
74, 6nfeld 2364 . . . . . . 7 (⊤ → Ⅎ𝑦 𝑥𝐴)
83, 7nfabd 2368 . . . . . 6 (⊤ → 𝑦{𝑥𝑥𝐴})
98mptru 1382 . . . . 5 𝑦{𝑥𝑥𝐴}
102, 9nffn 5370 . . . 4 𝑦 𝑧 Fn {𝑥𝑥𝐴}
11 df-ral 2489 . . . . 5 (∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
122a1i 9 . . . . . . . . . 10 (⊤ → 𝑦𝑧)
1312, 4nffvd 5588 . . . . . . . . 9 (⊤ → 𝑦(𝑧𝑥))
14 nfixp.2 . . . . . . . . . 10 𝑦𝐵
1514a1i 9 . . . . . . . . 9 (⊤ → 𝑦𝐵)
1613, 15nfeld 2364 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧𝑥) ∈ 𝐵)
177, 16nfimd 1608 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
183, 17nfald 1783 . . . . . 6 (⊤ → Ⅎ𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
1918mptru 1382 . . . . 5 𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵)
2011, 19nfxfr 1497 . . . 4 𝑦𝑥𝐴 (𝑧𝑥) ∈ 𝐵
2110, 20nfan 1588 . . 3 𝑦(𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)
2221nfab 2353 . 2 𝑦{𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
231, 22nfcxfr 2345 1 𝑦X𝑥𝐴 𝐵
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1371  wtru 1374  wnf 1483  wcel 2176  {cab 2191  wnfc 2335  wral 2484   Fn wfn 5266  cfv 5271  Xcixp 6785
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279  df-ixp 6786
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator