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

Theorem nfixpxy 6885
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 6867 . 2 X𝑥𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
2 nfcv 2374 . . . . 5 𝑦𝑧
3 nftru 1514 . . . . . . 7 𝑥
4 nfcvd 2375 . . . . . . . 8 (⊤ → 𝑦𝑥)
5 nfixp.1 . . . . . . . . 9 𝑦𝐴
65a1i 9 . . . . . . . 8 (⊤ → 𝑦𝐴)
74, 6nfeld 2390 . . . . . . 7 (⊤ → Ⅎ𝑦 𝑥𝐴)
83, 7nfabd 2394 . . . . . 6 (⊤ → 𝑦{𝑥𝑥𝐴})
98mptru 1406 . . . . 5 𝑦{𝑥𝑥𝐴}
102, 9nffn 5426 . . . 4 𝑦 𝑧 Fn {𝑥𝑥𝐴}
11 df-ral 2515 . . . . 5 (∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
122a1i 9 . . . . . . . . . 10 (⊤ → 𝑦𝑧)
1312, 4nffvd 5651 . . . . . . . . 9 (⊤ → 𝑦(𝑧𝑥))
14 nfixp.2 . . . . . . . . . 10 𝑦𝐵
1514a1i 9 . . . . . . . . 9 (⊤ → 𝑦𝐵)
1613, 15nfeld 2390 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧𝑥) ∈ 𝐵)
177, 16nfimd 1633 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
183, 17nfald 1808 . . . . . 6 (⊤ → Ⅎ𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
1918mptru 1406 . . . . 5 𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵)
2011, 19nfxfr 1522 . . . 4 𝑦𝑥𝐴 (𝑧𝑥) ∈ 𝐵
2110, 20nfan 1613 . . 3 𝑦(𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)
2221nfab 2379 . 2 𝑦{𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
231, 22nfcxfr 2371 1 𝑦X𝑥𝐴 𝐵
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1395  wtru 1398  wnf 1508  wcel 2202  {cab 2217  wnfc 2361  wral 2510   Fn wfn 5321  cfv 5326  Xcixp 6866
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-ixp 6867
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator