| 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 8882 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑦 ∣ (𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2926 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 3 | nfab1 2928 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝑥 ∈ 𝐴} | |
| 4 | 2, 3 | nffn 6622 | . . . 4 ⊢ Ⅎ𝑥 𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 5 | nfra1 3288 | . . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵 | |
| 6 | 4, 5 | nfan 1921 | . . 3 ⊢ Ⅎ𝑥(𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵) |
| 7 | 6 | nfab 2932 | . 2 ⊢ Ⅎ𝑥{𝑦 ∣ (𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵)} |
| 8 | 1, 7 | nfcxfr 2924 | 1 ⊢ Ⅎ𝑥X𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 399 ∈ wcel 2144 {cab 2742 Ⅎwnfc 2911 ∀wral 3078 Fn wfn 6518 ‘cfv 6523 Xcixp 8881 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ral 3079 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5103 df-opab 5165 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-fun 6525 df-fn 6526 df-ixp 8882 |
| This theorem is referenced by: ixpiunwdom 9540 ptbasfi 23643 hoidmvlelem3 47176 hspdifhsp 47195 hoiqssbllem2 47202 hspmbllem2 47206 opnvonmbllem2 47212 iinhoiicc 47253 iunhoiioo 47255 vonioo 47261 vonicc 47264 |
| Copyright terms: Public domain | W3C validator |