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

Theorem elequ12 2162
Description: An identity law for the non-logical predicate, which combines elequ1 2151 and elequ2 2159. The analogous theorems for class terms are eleq1 2848, eleq2 2849, and eleq12 2850 respectively. (Contributed by BJ, 29-Sep-2019.)
Assertion
Ref Expression
elequ12 ((𝑥 = 𝑦 ∧ 𝑧 = 𝑡) → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))

Proof of Theorem elequ12
StepHypRef Expression
1 elequ1 2151 . 2 (𝑥 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
2 elequ2 2159 . 2 (𝑧 = 𝑡 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))
31, 2sylan9bb 519 1 ((𝑥 = 𝑦 ∧ 𝑧 = 𝑡) → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812
This theorem is used by:  ru0  2163  onelfvnef1  8453  elirrv  9595  axtcond  37359  mh-unprimbi  37425  fvineqsneu  38428
  Copyright terms: Public domain W3C validator