HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem abeq1i 1563
Description: Equality of a class variable and a class abstraction (inference rule).
Hypothesis
Ref Expression
abeqri.1 |- {x | ph} = A
Assertion
Ref Expression
abeq1i |- (ph <-> x e. A)

Proof of Theorem abeq1i
StepHypRef Expression
1 abid 1458 . 2 |- (x e. {x | ph} <-> ph)
2 abeqri.1 . . 3 |- {x | ph} = A
32eleq2i 1530 . 2 |- (x e. {x | ph} <-> x e. A)
41, 3bitr3 175 1 |- (ph <-> x e. A)
Colors of variables: wff set class
Syntax hints:   <-> wb 146   = wceq 953   e. wcel 955  {cab 1456
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-ext 1452
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978  df-sb 1168  df-clab 1457  df-cleq 1462  df-clel 1465
Copyright terms: Public domain