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

Theorem eqri 3951
Description: Infer equality of classes from equivalence of membership. (Contributed by Thierry Arnoux, 7-Oct-2017.)
Hypotheses
Ref Expression
eqri.1 Ⅎ𝑥𝐴
eqri.2 Ⅎ𝑥𝐵
eqri.3 (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)
Assertion
Ref Expression
eqri 𝐴 = 𝐵

Proof of Theorem eqri
StepHypRef Expression
1 nftru 1837 . . 3 Ⅎ𝑥⊤
2 eqri.1 . . 3 Ⅎ𝑥𝐴
3 eqri.2 . . 3 Ⅎ𝑥𝐵
4 eqri.3 . . . 4 (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)
54a1i 11 . . 3 (⊤ → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
61, 2, 3, 5eqrd 3950 . 2 (⊤ → 𝐴 = 𝐵)
76mptru 1577 1 𝐴 = 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  ⊤wtru 1571   ∈ wcel 2145  Ⅎwnfc 2908
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2753  df-clel 2836  df-nfc 2910
This theorem is used by:  iunab  5010  iinab  5026  rnep  5909  difrab2  33087  esum2dlem  34717  eulerpartlemn  35006
  Copyright terms: Public domain W3C validator