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

Theorem abeq2d 1575
Description: Equality of a class variable and a class abstraction (deduction).
Hypothesis
Ref Expression
abeqd.1 |- (ph -> A = {x | ps})
Assertion
Ref Expression
abeq2d |- (ph -> (x e. A <-> ps))

Proof of Theorem abeq2d
StepHypRef Expression
1 abeqd.1 . . 3 |- (ph -> A = {x | ps})
21eleq2d 1544 . 2 |- (ph -> (x e. A <-> x e. {x | ps}))
3 abid 1468 . 2 |- (x e. {x | ps} <-> ps)
42, 3syl6bb 538 1 |- (ph -> (x e. A <-> ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   = wceq 958   e. wcel 960  {cab 1466
This theorem is referenced by:  genpn0 5118  genpss 5119  genpnmax 5122
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 965  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475
Copyright terms: Public domain