Theorem bj-elequ12 34007

Description: An identity law for the non-logical predicate, which combines elequ1 2117 and elequ2 2125. For the analogous theorems for class terms, see eleq1 2900, eleq2 2901 and eleq12 2902. TODO: move to main part. (Contributed by BJ, 29-Sep-2019.)

Assertion

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

Proof of Theorem bj-elequ12

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

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1777

This theorem is referenced by:  bj-ru0  34248