Theorem eqeqan12rd 2777

Description: A useful inference for substituting definitions into an equality. (Contributed by NM, 9-Aug-1994.)

Hypotheses

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

Assertion

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

Proof of Theorem eqeqan12rd

Step	Hyp	Ref	Expression
1		eqeqan12rd.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
2		eqeqan12rd.2	. . 3 ⊢ (𝜓 → 𝐶 = 𝐷)
3	1, 2	eqeqan12d 2776	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷))
4	3	ancoms 463	1 ⊢ ((𝜓 ∧ 𝜑) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-cleq 2754

This theorem is used by:  fmptco  7125  axcontlem4  29328  usgredg4  29578  cusgrsize  29815  uspgr2wlkeqi  30008  clwwlkf1  30411  eigorthi  32200  goeleq12bg  35849  expdiophlem2  43777  pwssplit4  43844  fcoresf1  47834  prproropf1olem4  48283  fmtnoodd  48313  isgrim  48675