| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfixpw | Structured version Visualization version GIF version | ||
| Description: Bound-variable hypothesis builder for indexed Cartesian product. Version of nfixp 8983 with a disjoint variable condition, which does not require ax-13 2404. (Contributed by Mario Carneiro, 15-Oct-2016.) Avoid ax-13 2404. (Revised by GG, 26-Jan-2024.) |
| Ref | Expression |
|---|---|
| nfixpw.1 | ⊢ Ⅎ𝑦𝐴 |
| nfixpw.2 | ⊢ Ⅎ𝑦𝐵 |
| Ref | Expression |
|---|---|
| nfixpw | ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ixp 8964 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2926 | . . . . 5 ⊢ Ⅎ𝑦𝑧 | |
| 3 | nfcv 2926 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝑥 | |
| 4 | nfixpw.1 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐴 | |
| 5 | 3, 4 | nfel 2940 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴 |
| 6 | 5 | nfab 2932 | . . . . . . 7 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
| 7 | 6 | a1i 11 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}) |
| 8 | 7 | mptru 1577 | . . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
| 9 | 2, 8 | nffn 6668 | . . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 10 | df-ral 3081 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) | |
| 11 | nftru 1837 | . . . . . . 7 ⊢ Ⅎ𝑥⊤ | |
| 12 | 5 | a1i 11 | . . . . . . . 8 ⊢ (⊤ → Ⅎ𝑦 𝑥 ∈ 𝐴) |
| 13 | 2 | a1i 11 | . . . . . . . . . 10 ⊢ (⊤ → Ⅎ𝑦𝑧) |
| 14 | 3 | a1i 11 | . . . . . . . . . 10 ⊢ (⊤ → Ⅎ𝑦𝑥) |
| 15 | 13, 14 | nffvd 6928 | . . . . . . . . 9 ⊢ (⊤ → Ⅎ𝑦(𝑧‘𝑥)) |
| 16 | nfixpw.2 | . . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵 | |
| 17 | 16 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → Ⅎ𝑦𝐵) |
| 18 | 15, 17 | nfeld 2937 | . . . . . . . 8 ⊢ (⊤ → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵) |
| 19 | 12, 18 | nfimd 1929 | . . . . . . 7 ⊢ (⊤ → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 20 | 11, 19 | nfald 2362 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 21 | 20 | mptru 1577 | . . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵) |
| 22 | 10, 21 | nfxfr 1886 | . . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 |
| 23 | 9, 22 | nfan 1934 | . . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵) |
| 24 | 23 | nfab 2932 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} |
| 25 | 1, 24 | nfcxfr 2924 | 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 2147 {cab 2741 Ⅎwnfc 2911 ∀wral 3080 Fn wfn 6561 ‘cfv 6566 Xcixp 8963 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fn 6569 df-fv 6574 df-ixp 8964 |
| This theorem is used by: vonioo 47965 |
| Copyright terms: Public domain | W3C validator |