Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > nfopdALT | Structured version Visualization version GIF version |
Description: Deduction version of bound-variable hypothesis builder nfop 4819. This shows how the deduction version of a not-free theorem such as nfop 4819 can be created from the corresponding not-free inference theorem. (Contributed by NM, 19-Nov-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nfopdALT.1 | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
nfopdALT.2 | ⊢ (𝜑 → Ⅎ𝑥𝐵) |
Ref | Expression |
---|---|
nfopdALT | ⊢ (𝜑 → Ⅎ𝑥〈𝐴, 𝐵〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfopdALT.1 | . 2 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
2 | nfopdALT.2 | . 2 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
3 | abidnf 3694 | . . . 4 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) | |
4 | 3 | adantr 483 | . . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) |
5 | abidnf 3694 | . . . 4 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵) | |
6 | 5 | adantl 484 | . . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵) |
7 | 4, 6 | opeq12d 4811 | . 2 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → 〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 = 〈𝐴, 𝐵〉) |
8 | nfaba1 2986 | . . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} | |
9 | nfaba1 2986 | . . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} | |
10 | 8, 9 | nfop 4819 | . 2 ⊢ Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 |
11 | 1, 2, 7, 10 | nfded2 36119 | 1 ⊢ (𝜑 → Ⅎ𝑥〈𝐴, 𝐵〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∀wal 1535 = wceq 1537 ∈ wcel 2114 {cab 2799 Ⅎwnfc 2961 〈cop 4573 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |