| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfixp1 | Structured version Visualization version GIF version | ||
| Description: The index variable in an indexed Cartesian product is not free. (Contributed by Jeff Madsen, 19-Jun-2011.) (Revised by Mario Carneiro, 15-Oct-2016.) |
| Ref | Expression |
|---|---|
| nfixp1 | ⊢ Ⅎ𝑥X𝑥 ∈ 𝐴 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ixp 8899 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑦 ∣ (𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2932 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 3 | nfab1 2934 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝑥 ∈ 𝐴} | |
| 4 | 2, 3 | nffn 6638 | . . . 4 ⊢ Ⅎ𝑥 𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 5 | nfra1 3296 | . . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵 | |
| 6 | 4, 5 | nfan 1927 | . . 3 ⊢ Ⅎ𝑥(𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵) |
| 7 | 6 | nfab 2938 | . 2 ⊢ Ⅎ𝑥{𝑦 ∣ (𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵)} |
| 8 | 1, 7 | nfcxfr 2930 | 1 ⊢ Ⅎ𝑥X𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 ∈ wcel 2150 {cab 2748 Ⅎwnfc 2917 ∀wral 3086 Fn wfn 6535 ‘cfv 6540 Xcixp 8898 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ral 3087 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-fun 6542 df-fn 6543 df-ixp 8899 |
| This theorem is referenced by: ixpiunwdom 9555 ptbasfi 23721 hoidmvlelem3 47263 hspdifhsp 47282 hoiqssbllem2 47289 hspmbllem2 47293 opnvonmbllem2 47299 iinhoiicc 47340 iunhoiioo 47342 vonioo 47348 vonicc 47351 |
| Copyright terms: Public domain | W3C validator |