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

Theorem cleqh 2913
 Description: Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions as in dfcleq 2792. See also cleqf 2983. (Contributed by NM, 26-May-1993.) (Proof shortened by Wolf Lammen, 14-Nov-2019.) Remove dependency on ax-13 2379. (Revised by BJ, 30-Nov-2020.)
Hypotheses
Ref Expression
cleqh.1 (𝑦𝐴 → ∀𝑥 𝑦𝐴)
cleqh.2 (𝑦𝐵 → ∀𝑥 𝑦𝐵)
Assertion
Ref Expression
cleqh (𝐴 = 𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem cleqh
StepHypRef Expression
1 dfcleq 2792 . 2 (𝐴 = 𝐵 ↔ ∀𝑦(𝑦𝐴𝑦𝐵))
2 nfv 1915 . . 3 𝑦(𝑥𝐴𝑥𝐵)
3 cleqh.1 . . . . 5 (𝑦𝐴 → ∀𝑥 𝑦𝐴)
43nf5i 2147 . . . 4 𝑥 𝑦𝐴
5 cleqh.2 . . . . 5 (𝑦𝐵 → ∀𝑥 𝑦𝐵)
65nf5i 2147 . . . 4 𝑥 𝑦𝐵
74, 6nfbi 1904 . . 3 𝑥(𝑦𝐴𝑦𝐵)
8 eleq1w 2872 . . . 4 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
9 eleq1w 2872 . . . 4 (𝑥 = 𝑦 → (𝑥𝐵𝑦𝐵))
108, 9bibi12d 349 . . 3 (𝑥 = 𝑦 → ((𝑥𝐴𝑥𝐵) ↔ (𝑦𝐴𝑦𝐵)))
112, 7, 10cbvalv1 2350 . 2 (∀𝑥(𝑥𝐴𝑥𝐵) ↔ ∀𝑦(𝑦𝐴𝑦𝐵))
121, 11bitr4i 281 1 (𝐴 = 𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1536   = wceq 1538   ∈ wcel 2111 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-cleq 2791  df-clel 2870 This theorem is referenced by:  abeq2  2922  abbiOLD  2930
 Copyright terms: Public domain W3C validator