ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  abidnf GIF version

Theorem abidnf 2917
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 1521 . . 3 (∀𝑥 𝑧𝐴𝑧𝐴)
2 nfcr 2321 . . . 4 (𝑥𝐴 → Ⅎ𝑥 𝑧𝐴)
32nfrd 1530 . . 3 (𝑥𝐴 → (𝑧𝐴 → ∀𝑥 𝑧𝐴))
41, 3impbid2 143 . 2 (𝑥𝐴 → (∀𝑥 𝑧𝐴𝑧𝐴))
54abbi1dv 2307 1 (𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧𝐴} = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wal 1361   = wceq 1363  wcel 2158  {cab 2173  wnfc 2316
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-11 1516  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2169
This theorem depends on definitions:  df-bi 117  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318
This theorem is referenced by:  dedhb  2918  nfopd  3807  nfimad  4991  nffvd  5539
  Copyright terms: Public domain W3C validator