| 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 8917 with a disjoint variable condition, which does not require ax-13 2406. (Contributed by Mario Carneiro, 15-Oct-2016.) Avoid ax-13 2406. (Revised by GG, 26-Jan-2024.) |
| Ref | Expression |
|---|---|
| nfixpw.1 | ⊢ Ⅎ𝑦𝐴 |
| nfixpw.2 | ⊢ Ⅎ𝑦𝐵 |
| Ref | Expression |
|---|---|
| nfixpw | ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ixp 8898 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2927 | . . . . 5 ⊢ Ⅎ𝑦𝑧 | |
| 3 | nfcv 2927 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝑥 | |
| 4 | nfixpw.1 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐴 | |
| 5 | 3, 4 | nfel 2941 | . . . . . . . 8 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴 |
| 6 | 5 | nfab 2933 | . . . . . . 7 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
| 7 | 6 | a1i 11 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}) |
| 8 | 7 | mptru 1577 | . . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
| 9 | 2, 8 | nffn 6638 | . . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 10 | df-ral 3082 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) | |
| 11 | nftru 1837 | . . . . . . 7 ⊢ Ⅎ𝑥⊤ | |
| 12 | 5 | a1i 11 | . . . . . . . 8 ⊢ (⊤ → Ⅎ𝑦 𝑥 ∈ 𝐴) |
| 13 | 2 | a1i 11 | . . . . . . . . . 10 ⊢ (⊤ → Ⅎ𝑦𝑧) |
| 14 | 3 | a1i 11 | . . . . . . . . . 10 ⊢ (⊤ → Ⅎ𝑦𝑥) |
| 15 | 13, 14 | nffvd 6897 | . . . . . . . . 9 ⊢ (⊤ → Ⅎ𝑦(𝑧‘𝑥)) |
| 16 | nfixpw.2 | . . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵 | |
| 17 | 16 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → Ⅎ𝑦𝐵) |
| 18 | 15, 17 | nfeld 2938 | . . . . . . . 8 ⊢ (⊤ → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵) |
| 19 | 12, 18 | nfimd 1927 | . . . . . . 7 ⊢ (⊤ → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 20 | 11, 19 | nfald 2363 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 21 | 20 | mptru 1577 | . . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵) |
| 22 | 10, 21 | nfxfr 1886 | . . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 |
| 23 | 9, 22 | nfan 1932 | . . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵) |
| 24 | 23 | nfab 2933 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} |
| 25 | 1, 24 | nfcxfr 2925 | 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 2146 {cab 2743 Ⅎwnfc 2912 ∀wral 3081 Fn wfn 6535 ‘cfv 6540 Xcixp 8897 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 |
| 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 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fn 6543 df-fv 6548 df-ixp 8898 |
| This theorem is used by: vonioo 47429 |
| Copyright terms: Public domain | W3C validator |