![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfopd | Structured version Visualization version GIF version |
Description: Deduction version of bound-variable hypothesis builder nfop 4781. This shows how the deduction version of a not-free theorem such as nfop 4781 can be created from the corresponding not-free inference theorem. (Contributed by NM, 4-Feb-2008.) |
Ref | Expression |
---|---|
nfopd.2 | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
nfopd.3 | ⊢ (𝜑 → Ⅎ𝑥𝐵) |
Ref | Expression |
---|---|
nfopd | ⊢ (𝜑 → Ⅎ𝑥〈𝐴, 𝐵〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfaba1 2963 | . . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} | |
2 | nfaba1 2963 | . . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} | |
3 | 1, 2 | nfop 4781 | . 2 ⊢ Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 |
4 | nfopd.2 | . . 3 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
5 | nfopd.3 | . . 3 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
6 | nfnfc1 2958 | . . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴 | |
7 | nfnfc1 2958 | . . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐵 | |
8 | 6, 7 | nfan 1900 | . . . 4 ⊢ Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) |
9 | abidnf 3642 | . . . . . 6 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) | |
10 | 9 | adantr 484 | . . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) |
11 | abidnf 3642 | . . . . . 6 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵) | |
12 | 11 | adantl 485 | . . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵) |
13 | 10, 12 | opeq12d 4773 | . . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → 〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 = 〈𝐴, 𝐵〉) |
14 | 8, 13 | nfceqdf 2951 | . . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 ↔ Ⅎ𝑥〈𝐴, 𝐵〉)) |
15 | 4, 5, 14 | syl2anc 587 | . 2 ⊢ (𝜑 → (Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 ↔ Ⅎ𝑥〈𝐴, 𝐵〉)) |
16 | 3, 15 | mpbii 236 | 1 ⊢ (𝜑 → Ⅎ𝑥〈𝐴, 𝐵〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∀wal 1536 = wceq 1538 ∈ wcel 2111 {cab 2776 Ⅎwnfc 2936 〈cop 4531 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 |
This theorem is referenced by: nfbrd 5076 dfid3 5427 nfovd 7164 |
Copyright terms: Public domain | W3C validator |