Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > abidnf | Structured version Visualization version GIF version |
Description: Identity used to create closed-form versions of bound-variable hypothesis builders for class expressions. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Mario Carneiro, 12-Oct-2016.) |
Ref | Expression |
---|---|
abidnf | ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sp 2177 | . . 3 ⊢ (∀𝑥 𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐴) | |
2 | nfcr 2966 | . . . 4 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑧 ∈ 𝐴) | |
3 | 2 | nf5rd 2191 | . . 3 ⊢ (Ⅎ𝑥𝐴 → (𝑧 ∈ 𝐴 → ∀𝑥 𝑧 ∈ 𝐴)) |
4 | 1, 3 | impbid2 228 | . 2 ⊢ (Ⅎ𝑥𝐴 → (∀𝑥 𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)) |
5 | 4 | abbi1dv 2952 | 1 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1531 = wceq 1533 ∈ wcel 2110 {cab 2799 Ⅎwnfc 2961 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-12 2172 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 |
This theorem is referenced by: dedhb 3695 nfopd 4814 nfimad 5933 nffvd 6677 nfunidALT2 36099 nfunidALT 36100 nfopdALT 36101 |
Copyright terms: Public domain | W3C validator |