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

Theorem nfixpw 8923
Description: Bound-variable hypothesis builder for indexed Cartesian product. Version of nfixp 8924 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 8905 . 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 1577 . . . . 5 𝑦{𝑥𝑥𝐴}
92, 8nffn 6631 . . . 4 𝑦 𝑧 Fn {𝑥𝑥𝐴}
10 df-ral 3077 . . . . 5 (∀𝑥𝐴 (𝑧𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
11 nftru 1837 . . . . . . 7 𝑥
125a1i 11 . . . . . . . 8 (⊤ → Ⅎ𝑦 𝑥𝐴)
132a1i 11 . . . . . . . . . 10 (⊤ → 𝑦𝑧)
143a1i 11 . . . . . . . . . 10 (⊤ → 𝑦𝑥)
1513, 14nffvd 6890 . . . . . . . . 9 (⊤ → 𝑦(𝑧𝑥))
16 nfixpw.2 . . . . . . . . . 10 𝑦𝐵
1716a1i 11 . . . . . . . . 9 (⊤ → 𝑦𝐵)
1815, 17nfeld 2933 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧𝑥) ∈ 𝐵)
1912, 18nfimd 1927 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
2011, 19nfald 2358 . . . . . 6 (⊤ → Ⅎ𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵))
2120mptru 1577 . . . . 5 𝑦𝑥(𝑥𝐴 → (𝑧𝑥) ∈ 𝐵)
2210, 21nfxfr 1886 . . . 4 𝑦𝑥𝐴 (𝑧𝑥) ∈ 𝐵
239, 22nfan 1932 . . 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 1568  wtru 1571  wnf 1816  wcel 2145  {cab 2738  wnfc 2907  wral 3076   Fn wfn 6528  cfv 6533  Xcixp 8904
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541  df-ixp 8905
This theorem is used by:  vonioo  47510
  Copyright terms: Public domain W3C validator