MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  abidnf Structured version   Visualization version   GIF version

Theorem abidnf 3663
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.)
Assertion
Ref Expression
abidnf (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
Distinct variable groups:   𝑥,𝑧   𝑧,𝐴
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem abidnf
StepHypRef Expression
1 sp 2223 . . 3 (∀𝑥 𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐴)
2 nfcr 2916 . . . 4 (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑧 ∈ 𝐴)
32nf5rd 2236 . . 3 (Ⅎ𝑥𝐴 → (𝑧 ∈ 𝐴 → ∀𝑥 𝑧 ∈ 𝐴))
41, 3impbid2 229 . 2 (Ⅎ𝑥𝐴 → (∀𝑥 𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
54eqabcdv 2898 1 (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741  Ⅎwnfc 2911
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913
This theorem is used by:  dedhb  3664  nfopd  4855  nfimad  6083  nffvd  6928  nfunidALT2  40292  nfunidALT  40293  nfopdALT  40294
  Copyright terms: Public domain W3C validator