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

Theorem cleqh 2184
Description: Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions. See also cleqf 2248. (Contributed by NM, 5-Aug-1993.)
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 2079 . 2 (𝐴 = 𝐵 ↔ ∀𝑦(𝑦𝐴𝑦𝐵))
2 ax-17 1462 . . . 4 ((𝑥𝐴𝑥𝐵) → ∀𝑦(𝑥𝐴𝑥𝐵))
3 dfbi2 380 . . . . 5 ((𝑦𝐴𝑦𝐵) ↔ ((𝑦𝐴𝑦𝐵) ∧ (𝑦𝐵𝑦𝐴)))
4 cleqh.1 . . . . . . 7 (𝑦𝐴 → ∀𝑥 𝑦𝐴)
5 cleqh.2 . . . . . . 7 (𝑦𝐵 → ∀𝑥 𝑦𝐵)
64, 5hbim 1480 . . . . . 6 ((𝑦𝐴𝑦𝐵) → ∀𝑥(𝑦𝐴𝑦𝐵))
75, 4hbim 1480 . . . . . 6 ((𝑦𝐵𝑦𝐴) → ∀𝑥(𝑦𝐵𝑦𝐴))
86, 7hban 1482 . . . . 5 (((𝑦𝐴𝑦𝐵) ∧ (𝑦𝐵𝑦𝐴)) → ∀𝑥((𝑦𝐴𝑦𝐵) ∧ (𝑦𝐵𝑦𝐴)))
93, 8hbxfrbi 1404 . . . 4 ((𝑦𝐴𝑦𝐵) → ∀𝑥(𝑦𝐴𝑦𝐵))
10 eleq1 2147 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
11 eleq1 2147 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐵𝑦𝐵))
1210, 11bibi12d 233 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝐴𝑥𝐵) ↔ (𝑦𝐴𝑦𝐵)))
1312biimpd 142 . . . 4 (𝑥 = 𝑦 → ((𝑥𝐴𝑥𝐵) → (𝑦𝐴𝑦𝐵)))
142, 9, 13cbv3h 1675 . . 3 (∀𝑥(𝑥𝐴𝑥𝐵) → ∀𝑦(𝑦𝐴𝑦𝐵))
1512equcoms 1638 . . . . 5 (𝑦 = 𝑥 → ((𝑥𝐴𝑥𝐵) ↔ (𝑦𝐴𝑦𝐵)))
1615biimprd 156 . . . 4 (𝑦 = 𝑥 → ((𝑦𝐴𝑦𝐵) → (𝑥𝐴𝑥𝐵)))
179, 2, 16cbv3h 1675 . . 3 (∀𝑦(𝑦𝐴𝑦𝐵) → ∀𝑥(𝑥𝐴𝑥𝐵))
1814, 17impbii 124 . 2 (∀𝑥(𝑥𝐴𝑥𝐵) ↔ ∀𝑦(𝑦𝐴𝑦𝐵))
191, 18bitr4i 185 1 (𝐴 = 𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103  wal 1285   = wceq 1287  wcel 1436
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067
This theorem depends on definitions:  df-bi 115  df-nf 1393  df-cleq 2078  df-clel 2081
This theorem is referenced by:  abeq2  2193
  Copyright terms: Public domain W3C validator