| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfixp | Structured version Visualization version GIF version | ||
| Description: Bound-variable hypothesis builder for indexed Cartesian product. Usage of this theorem is discouraged because it depends on ax-13 2403. Use the weaker nfixpw 8898 when possible. (Contributed by Mario Carneiro, 15-Oct-2016.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nfixp.1 | ⊢ Ⅎ𝑦𝐴 |
| nfixp.2 | ⊢ Ⅎ𝑦𝐵 |
| Ref | Expression |
|---|---|
| nfixp | ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ixp 8880 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2924 | . . . . 5 ⊢ Ⅎ𝑦𝑧 | |
| 3 | nftru 1824 | . . . . . . 7 ⊢ Ⅎ𝑥⊤ | |
| 4 | nfcvf 2950 | . . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥) | |
| 5 | 4 | adantl 485 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑥) |
| 6 | nfixp.1 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐴 | |
| 7 | 6 | a1i 11 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐴) |
| 8 | 5, 7 | nfeld 2935 | . . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦 𝑥 ∈ 𝐴) |
| 9 | 3, 8 | nfabd2 2947 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}) |
| 10 | 9 | mptru 1567 | . . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
| 11 | 2, 10 | nffn 6620 | . . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 12 | df-ral 3077 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) | |
| 13 | 2 | a1i 11 | . . . . . . . . . 10 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑧) |
| 14 | 13, 5 | nffvd 6879 | . . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥)) |
| 15 | nfixp.2 | . . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵 | |
| 16 | 15 | a1i 11 | . . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐵) |
| 17 | 14, 16 | nfeld 2935 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵) |
| 18 | 8, 17 | nfimd 1914 | . . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 19 | 3, 18 | nfald2 2476 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 20 | 19 | mptru 1567 | . . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵) |
| 21 | 12, 20 | nfxfr 1873 | . . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 |
| 22 | 11, 21 | nfan 1919 | . . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵) |
| 23 | 22 | nfab 2930 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} |
| 24 | 1, 23 | nfcxfr 2922 | 1 ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∀wal 1558 ⊤wtru 1561 Ⅎwnf 1803 ∈ wcel 2142 {cab 2740 Ⅎwnfc 2909 ∀wral 3076 Fn wfn 6516 ‘cfv 6521 Xcixp 8879 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-13 2403 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-iota 6477 df-fun 6523 df-fn 6524 df-fv 6529 df-ixp 8880 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |