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

Theorem nfixpw 8937
Description: Bound-variable hypothesis builder for indexed Cartesian product. Version of nfixp 8938 with a disjoint variable condition, which does not require ax-13 2402. (Contributed by Mario Carneiro, 15-Oct-2016.) Avoid ax-13 2402. (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 8919 . 2 X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
2 nfcv 2923 . . . . 5 Ⅎ𝑦𝑧
3 nfcv 2923 . . . . . . . . 9 Ⅎ𝑦𝑥
4 nfixpw.1 . . . . . . . . 9 Ⅎ𝑦𝐴
53, 4nfel 2937 . . . . . . . 8 Ⅎ𝑦 𝑥 ∈ 𝐴
65nfab 2929 . . . . . . 7 Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}
76a1i 11 . . . . . 6 (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴})
87mptru 1577 . . . . 5 Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}
92, 8nffn 6636 . . . 4 Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴}
10 df-ral 3078 . . . . 5 (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
11 nftru 1837 . . . . . . 7 Ⅎ𝑥⊤
125a1i 11 . . . . . . . 8 (⊤ → Ⅎ𝑦 𝑥 ∈ 𝐴)
132a1i 11 . . . . . . . . . 10 (⊤ → Ⅎ𝑦𝑧)
143a1i 11 . . . . . . . . . 10 (⊤ → Ⅎ𝑦𝑥)
1513, 14nffvd 6895 . . . . . . . . 9 (⊤ → Ⅎ𝑦(𝑧‘𝑥))
16 nfixpw.2 . . . . . . . . . 10 Ⅎ𝑦𝐵
1716a1i 11 . . . . . . . . 9 (⊤ → Ⅎ𝑦𝐵)
1815, 17nfeld 2934 . . . . . . . 8 (⊤ → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵)
1912, 18nfimd 1927 . . . . . . 7 (⊤ → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
2011, 19nfald 2359 . . . . . 6 (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
2120mptru 1577 . . . . 5 Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)
2210, 21nfxfr 1886 . . . 4 Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵
239, 22nfan 1932 . . 3 Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)
2423nfab 2929 . 2 Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
251, 24nfcxfr 2921 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 2739  Ⅎwnfc 2908  ∀wral 3077   Fn wfn 6532  ‘cfv 6537  Xcixp 8918
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 2733
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 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-ixp 8919
This theorem is used by:  vonioo  47661
  Copyright terms: Public domain W3C validator