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

Theorem nfixpw 8948
Description: Bound-variable hypothesis builder for indexed Cartesian product. Version of nfixp 8949 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by Mario Carneiro, 15-Oct-2016.) Avoid ax-13 2401. (Revised by GG, 26-Jan-2024.)
Hypotheses
Ref Expression
nfixpw.1 Ⅎ𝑦𝐴
nfixpw.2 Ⅎ𝑦𝐵
Assertion
Ref Expression
nfixpw Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)

Proof of Theorem nfixpw
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-ixp 8930 . 2 X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
2 nfcv 2922 . . . . 5 Ⅎ𝑦𝑧
3 nfcv 2922 . . . . . . . . 9 Ⅎ𝑦𝑥
4 nfixpw.1 . . . . . . . . 9 Ⅎ𝑦𝐴
53, 4nfel 2936 . . . . . . . 8 Ⅎ𝑦 𝑥 ∈ 𝐴
65nfab 2928 . . . . . . 7 Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}
76a1i 11 . . . . . 6 (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴})
87mptru 1576 . . . . 5 Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}
92, 8nffn 6639 . . . 4 Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴}
10 df-ral 3077 . . . . 5 (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
11 nftru 1836 . . . . . . 7 Ⅎ𝑥⊤
125a1i 11 . . . . . . . 8 (⊤ → Ⅎ𝑦 𝑥 ∈ 𝐴)
132a1i 11 . . . . . . . . . 10 (⊤ → Ⅎ𝑦𝑧)
143a1i 11 . . . . . . . . . 10 (⊤ → Ⅎ𝑦𝑥)
1513, 14nffvd 6898 . . . . . . . . 9 (⊤ → Ⅎ𝑦(𝑧‘𝑥))
16 nfixpw.2 . . . . . . . . . 10 Ⅎ𝑦𝐵
1716a1i 11 . . . . . . . . 9 (⊤ → Ⅎ𝑦𝐵)
1815, 17nfeld 2933 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵)
1912, 18nfimd 1926 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
2011, 19nfald 2358 . . . . . 6 (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
2120mptru 1576 . . . . 5 Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)
2210, 21nfxfr 1885 . . . 4 Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵
239, 22nfan 1931 . . 3 Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)
2423nfab 2928 . 2 Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
251, 24nfcxfr 2920 1 Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567  ⊤wtru 1570  Ⅎwnf 1815   ∈ wcel 2144  {cab 2738  Ⅎwnfc 2907  ∀wral 3076   Fn wfn 6534  ‘cfv 6539  Xcixp 8929
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-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fn 6542  df-fv 6547  df-ixp 8930
This theorem is used by:  vonioo  47786
  Copyright terms: Public domain W3C validator