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

Theorem cleqf 1557
Description: Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions.
Hypotheses
Ref Expression
cleqf.1 (yA → ∀x yA)
cleqf.2 (yB → ∀x yB)
Assertion
Ref Expression
cleqf (A = B ↔ ∀x(xAxB))
Distinct variable groups:   y,A   y,B   x,y

Proof of Theorem cleqf
StepHypRef Expression
1 dfcleq 1468 . 2 (A = B ↔ ∀y(yAyB))
2 ax-17 969 . . 3 ((xAxB) → ∀y(xAxB))
3 cleqf.1 . . . 4 (yA → ∀x yA)
4 cleqf.2 . . . 4 (yB → ∀x yB)
53, 4hbbi 1008 . . 3 ((yAyB) → ∀x(yAyB))
6 eleq1 1531 . . . 4 (x = y → (xAyA))
7 eleq1 1531 . . . 4 (x = y → (xByB))
86, 7bibi12d 628 . . 3 (x = y → ((xAxB) ↔ (yAyB)))
92, 5, 8cbval 1163 . 2 (∀x(xAxB) ↔ ∀y(yAyB))
101, 9bitr4 176 1 (A = B ↔ ∀x(xAxB))
Colors of variables: wff set class
Syntax hints:   → wi 3   ↔ wb 146  ∀wal 952   = wceq 954   ∈ wcel 956
This theorem is referenced by:  abeq2 1565  eq2ab 1570  cbvab 1904  ne0f 2283
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-ext 1457
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 979  df-cleq 1467  df-clel 1470
Copyright terms: Public domain