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

Theorem nfixpxy 6674
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 6656 . 2 X𝑥𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
2 nfcv 2306 . . . . 5 𝑦𝑧
3 nftru 1453 . . . . . . 7 𝑥
4 nfcvd 2307 . . . . . . . 8 (⊤ → 𝑦𝑥)
5 nfixp.1 . . . . . . . . 9 𝑦𝐴
65a1i 9 . . . . . . . 8 (⊤ → 𝑦𝐴)
74, 6nfeld 2322 . . . . . . 7 (⊤ → Ⅎ𝑦 𝑥𝐴)
83, 7nfabd 2326 . . . . . 6 (⊤ → 𝑦{𝑥𝑥𝐴})
98mptru 1351 . . . . 5 𝑦{𝑥𝑥𝐴}
102, 9nffn 5278 . . . 4 𝑦 𝑧 Fn {𝑥𝑥𝐴}
11 df-ral 2447 . . . . 5 (∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
122a1i 9 . . . . . . . . . 10 (⊤ → 𝑦𝑧)
1312, 4nffvd 5492 . . . . . . . . 9 (⊤ → 𝑦(𝑧𝑥))
14 nfixp.2 . . . . . . . . . 10 𝑦𝐵
1514a1i 9 . . . . . . . . 9 (⊤ → 𝑦𝐵)
1613, 15nfeld 2322 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧𝑥) ∈ 𝐵)
177, 16nfimd 1572 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
183, 17nfald 1747 . . . . . 6 (⊤ → Ⅎ𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
1918mptru 1351 . . . . 5 𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵)
2011, 19nfxfr 1461 . . . 4 𝑦𝑥𝐴 (𝑧𝑥) ∈ 𝐵
2110, 20nfan 1552 . . 3 𝑦(𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)
2221nfab 2311 . 2 𝑦{𝑧 ∣ (𝑧 Fn {𝑥𝑥𝐴} ∧ ∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵)}
231, 22nfcxfr 2303 1 𝑦X𝑥𝐴 𝐵
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wal 1340  wtru 1343  wnf 1447  wcel 2135  {cab 2150  wnfc 2293  wral 2442   Fn wfn 5177  cfv 5182  Xcixp 6655
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-ext 2146
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-un 3115  df-in 3117  df-ss 3124  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-iota 5147  df-fun 5184  df-fn 5185  df-fv 5190  df-ixp 6656
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator