Theorem elequ12 2163

Description: An identity law for the non-logical predicate, which combines elequ1 2152 and elequ2 2160. The analogous theorems for class terms are eleq1 2853, eleq2 2854, and eleq12 2855 respectively. (Contributed by BJ, 29-Sep-2019.)

Assertion

Ref	Expression
elequ12	⊢ ((𝑥 = 𝑦 ∧ 𝑧 = 𝑡) → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))

Proof of Theorem elequ12

Step	Hyp	Ref	Expression
1		elequ1 2152	. 2 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
2		elequ2 2160	. 2 ⊢ (𝑧 = 𝑡 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))
3	1, 2	sylan9bb 518	1 ⊢ ((𝑥 = 𝑦 ∧ 𝑧 = 𝑡) → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1803

This theorem is referenced by:  ru0  2164  elirrv  9547  axtcond  36851  mh-inf3f1  36914  mh-unprimbi  36917  fvineqsneu  37917