| 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 8846 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑦 ∣ (𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2898 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 3 | nfab1 2900 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝑥 ∈ 𝐴} | |
| 4 | 2, 3 | nffn 6597 | . . . 4 ⊢ Ⅎ𝑥 𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 5 | nfra1 3261 | . . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵 | |
| 6 | 4, 5 | nfan 1901 | . . 3 ⊢ Ⅎ𝑥(𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵) |
| 7 | 6 | nfab 2904 | . 2 ⊢ Ⅎ𝑥{𝑦 ∣ (𝑦 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑦‘𝑥) ∈ 𝐵)} |
| 8 | 1, 7 | nfcxfr 2896 | 1 ⊢ Ⅎ𝑥X𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 ∈ wcel 2114 {cab 2714 Ⅎwnfc 2883 ∀wral 3051 Fn wfn 6493 ‘cfv 6498 Xcixp 8845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ral 3052 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-fun 6500 df-fn 6501 df-ixp 8846 |
| This theorem is referenced by: ixpiunwdom 9505 ptbasfi 23546 hoidmvlelem3 47025 hspdifhsp 47044 hoiqssbllem2 47051 hspmbllem2 47055 opnvonmbllem2 47061 iinhoiicc 47102 iunhoiioo 47104 vonioo 47110 vonicc 47113 |
| Copyright terms: Public domain | W3C validator |