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

Theorem abbib 2349
Description: Equal class abstractions require equivalent formulas, and conversely. (Contributed by NM, 25-Nov-2013.) (Revised by Mario Carneiro, 11-Aug-2016.) Remove dependency on ax-8 1553 and df-clel 2227 (by avoiding use of cleqh 2331). (Revised by BJ, 23-Jun-2019.) Definitial form. (Revised by Wolf Lammen, 23-Feb-2025.)
Assertion
Ref Expression
abbib ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑥(𝜑𝜓))

Proof of Theorem abbib
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfcleq 2225 . 2 ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑦(𝑦 ∈ {𝑥𝜑} ↔ 𝑦 ∈ {𝑥𝜓}))
2 nfsab1 2221 . . . 4 𝑥 𝑦 ∈ {𝑥𝜑}
3 nfsab1 2221 . . . 4 𝑥 𝑦 ∈ {𝑥𝜓}
42, 3nfbi 1638 . . 3 𝑥(𝑦 ∈ {𝑥𝜑} ↔ 𝑦 ∈ {𝑥𝜓})
5 nfv 1577 . . 3 𝑦(𝜑𝜓)
6 df-clab 2218 . . . . 5 (𝑦 ∈ {𝑥𝜑} ↔ [𝑦 / 𝑥]𝜑)
7 sbequ12r 1820 . . . . 5 (𝑦 = 𝑥 → ([𝑦 / 𝑥]𝜑𝜑))
86, 7bitrid 192 . . . 4 (𝑦 = 𝑥 → (𝑦 ∈ {𝑥𝜑} ↔ 𝜑))
9 df-clab 2218 . . . . 5 (𝑦 ∈ {𝑥𝜓} ↔ [𝑦 / 𝑥]𝜓)
10 sbequ12r 1820 . . . . 5 (𝑦 = 𝑥 → ([𝑦 / 𝑥]𝜓𝜓))
119, 10bitrid 192 . . . 4 (𝑦 = 𝑥 → (𝑦 ∈ {𝑥𝜓} ↔ 𝜓))
128, 11bibi12d 235 . . 3 (𝑦 = 𝑥 → ((𝑦 ∈ {𝑥𝜑} ↔ 𝑦 ∈ {𝑥𝜓}) ↔ (𝜑𝜓)))
134, 5, 12cbvalv1 1799 . 2 (∀𝑦(𝑦 ∈ {𝑥𝜑} ↔ 𝑦 ∈ {𝑥𝜓}) ↔ ∀𝑥(𝜑𝜓))
141, 13bitri 184 1 ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑥(𝜑𝜓))
Colors of variables: wff set class
Syntax hints:  wb 105  wal 1396   = wceq 1398  [wsb 1810  wcel 2202  {cab 2217
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-11 1555  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator