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 2371. Use the weaker nfixpw 8752 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 8734 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} | |
2 | nfcv 2905 | . . . . 5 ⊢ Ⅎ𝑦𝑧 | |
3 | nftru 1805 | . . . . . . 7 ⊢ Ⅎ𝑥⊤ | |
4 | nfcvf 2934 | . . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥) | |
5 | 4 | adantl 482 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑥) |
6 | nfixp.1 | . . . . . . . . 9 ⊢ Ⅎ𝑦𝐴 | |
7 | 6 | a1i 11 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐴) |
8 | 5, 7 | nfeld 2916 | . . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦 𝑥 ∈ 𝐴) |
9 | 3, 8 | nfabd2 2931 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}) |
10 | 9 | mptru 1547 | . . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴} |
11 | 2, 10 | nffn 6570 | . . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} |
12 | df-ral 3063 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) | |
13 | 2 | a1i 11 | . . . . . . . . . 10 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑧) |
14 | 13, 5 | nffvd 6823 | . . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥)) |
15 | nfixp.2 | . . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵 | |
16 | 15 | a1i 11 | . . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐵) |
17 | 14, 16 | nfeld 2916 | . . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵) |
18 | 8, 17 | nfimd 1896 | . . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
19 | 3, 18 | nfald2 2444 | . . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)) |
20 | 19 | mptru 1547 | . . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵) |
21 | 12, 20 | nfxfr 1854 | . . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 |
22 | 11, 21 | nfan 1901 | . . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵) |
23 | 22 | nfab 2911 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)} |
24 | 1, 23 | nfcxfr 2903 | 1 ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∀wal 1538 ⊤wtru 1541 Ⅎwnf 1784 ∈ wcel 2105 {cab 2714 Ⅎwnfc 2885 ∀wral 3062 Fn wfn 6460 ‘cfv 6465 Xcixp 8733 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-13 2371 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ral 3063 df-rex 3072 df-rab 3405 df-v 3443 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4268 df-if 4472 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4851 df-br 5088 df-opab 5150 df-rel 5614 df-cnv 5615 df-co 5616 df-dm 5617 df-iota 6417 df-fun 6467 df-fn 6468 df-fv 6473 df-ixp 8734 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |