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 2850, eleq2 2851, and eleq12 2852 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 519	1 ⊢ ((𝑥 = 𝑦 ∧ 𝑧 = 𝑡) → (𝑥 ∈ 𝑧 ↔ 𝑦 ∈ 𝑡))

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 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813

This theorem is used by:  ru0  2164  elirrv  9573  axtcond  37105  mh-inf3f1  37168  mh-unprimbi  37171  fvineqsneu  38173