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

Theorem nfixpxy 6785
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 6767 . 2 X𝑥𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
2 nfcv 2339 . . . . 5 𝑦𝑧
3 nftru 1480 . . . . . . 7 𝑥
4 nfcvd 2340 . . . . . . . 8 (⊤ → 𝑦𝑥)
5 nfixp.1 . . . . . . . . 9 𝑦𝐴
65a1i 9 . . . . . . . 8 (⊤ → 𝑦𝐴)
74, 6nfeld 2355 . . . . . . 7 (⊤ → Ⅎ𝑦 𝑥𝐴)
83, 7nfabd 2359 . . . . . 6 (⊤ → 𝑦{𝑥𝑥𝐴})
98mptru 1373 . . . . 5 𝑦{𝑥𝑥𝐴}
102, 9nffn 5355 . . . 4 𝑦 𝑧 Fn {𝑥𝑥𝐴}
11 df-ral 2480 . . . . 5 (∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
122a1i 9 . . . . . . . . . 10 (⊤ → 𝑦𝑧)
1312, 4nffvd 5573 . . . . . . . . 9 (⊤ → 𝑦(𝑧𝑥))
14 nfixp.2 . . . . . . . . . 10 𝑦𝐵
1514a1i 9 . . . . . . . . 9 (⊤ → 𝑦𝐵)
1613, 15nfeld 2355 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧𝑥) ∈ 𝐵)
177, 16nfimd 1599 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
183, 17nfald 1774 . . . . . 6 (⊤ → Ⅎ𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
1918mptru 1373 . . . . 5 𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵)
2011, 19nfxfr 1488 . . . 4 𝑦𝑥𝐴 (𝑧𝑥) ∈ 𝐵
2110, 20nfan 1579 . . 3 𝑦(𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)
2221nfab 2344 . 2 𝑦{𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
231, 22nfcxfr 2336 1 𝑦X𝑥𝐴 𝐵
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1362  wtru 1365  wnf 1474  wcel 2167  {cab 2182  wnfc 2326  wral 2475   Fn wfn 5254  cfv 5259  Xcixp 6766
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-ixp 6767
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator