| 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 2377. Use the weaker nfixpw 8866 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 8848 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} | |
| 2 | nfcv 2899 | . . . . 5 ⊢ Ⅎ𝑦𝑧 | |
| 3 | nftru 1806 | . . . . . . 7 ⊢ Ⅎ𝑥⊤ | |
| 4 | nfcvf 2926 | . . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥) | |
| 5 | 4 | adantl 481 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑥) |
| 6 | nfixp.1 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐴 | |
| 7 | 6 | a1i 11 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐴) |
| 8 | 5, 7 | nfeld 2911 | . . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦 𝑥 ∈ 𝐴) |
| 9 | 3, 8 | nfabd2 2923 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}) |
| 10 | 9 | mptru 1549 | . . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
| 11 | 2, 10 | nffn 6599 | . . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 12 | df-ral 3053 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) | |
| 13 | 2 | a1i 11 | . . . . . . . . . 10 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑧) |
| 14 | 13, 5 | nffvd 6854 | . . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥)) |
| 15 | nfixp.2 | . . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵 | |
| 16 | 15 | a1i 11 | . . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐵) |
| 17 | 14, 16 | nfeld 2911 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵) |
| 18 | 8, 17 | nfimd 1896 | . . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 19 | 3, 18 | nfald2 2450 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
| 20 | 19 | mptru 1549 | . . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵) |
| 21 | 12, 20 | nfxfr 1855 | . . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 |
| 22 | 11, 21 | nfan 1901 | . . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵) |
| 23 | 22 | nfab 2905 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} |
| 24 | 1, 23 | nfcxfr 2897 | 1 ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∀wal 1540 ⊤wtru 1543 Ⅎwnf 1785 ∈ wcel 2114 {cab 2715 Ⅎwnfc 2884 ∀wral 3052 Fn wfn 6495 ‘cfv 6500 Xcixp 8847 |
| 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-13 2377 ax-ext 2709 |
| 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 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fn 6503 df-fv 6508 df-ixp 8848 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |