Theorem eqeqan12dOLD 2758

Description: Obsolete version of eqeqan12d 2751 as of 23-Oct-2024. (Contributed by NM, 9-Aug-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 20-Nov-2019.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
eqeqan12dOLD.1	⊢ (𝜑 → 𝐴 = 𝐵)
eqeqan12dOLD.2	⊢ (𝜓 → 𝐶 = 𝐷)

Assertion

Ref	Expression
eqeqan12dOLD	⊢ ((𝜑 ∧ 𝜓) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷))

Proof of Theorem eqeqan12dOLD

Step	Hyp	Ref	Expression
1		eqeqan12dOLD.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
2	1	adantr 484	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐵)
3		eqeqan12dOLD.2	. . 3 ⊢ (𝜓 → 𝐶 = 𝐷)
4	3	adantl 485	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)
5	2, 4	eqeq12dOLD 2757	1 ⊢ ((𝜑 ∧ 𝜓) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1543

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-9 2120  ax-ext 2708

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1788  df-cleq 2729

This theorem is referenced by: (None)