Theorem weeq12d 36628

Description: Equality deduction for well-orders. (Contributed by Stefan O'Rear, 19-Jan-2015.)

Hypotheses

Ref	Expression
weeq12d.l	⊢ (𝜑 → 𝑅 = 𝑆)
weeq12d.r	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
weeq12d	⊢ (𝜑 → (𝑅 We 𝐴 ↔ 𝑆 We 𝐵))

Proof of Theorem weeq12d

Step	Hyp	Ref	Expression
1		weeq12d.l	. . 3 ⊢ (𝜑 → 𝑅 = 𝑆)
2		weeq1 5026	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 We 𝐴 ↔ 𝑆 We 𝐴))
3	1, 2	syl 17	. 2 ⊢ (𝜑 → (𝑅 We 𝐴 ↔ 𝑆 We 𝐴))
4		weeq12d.r	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
5		weeq2 5027	. . 3 ⊢ (𝐴 = 𝐵 → (𝑆 We 𝐴 ↔ 𝑆 We 𝐵))
6	4, 5	syl 17	. 2 ⊢ (𝜑 → (𝑆 We 𝐴 ↔ 𝑆 We 𝐵))
7	3, 6	bitrd 267	1 ⊢ (𝜑 → (𝑅 We 𝐴 ↔ 𝑆 We 𝐵))

Syntax hints:   → wi 4   ↔ wb 195   = wceq 1475   We wwe 4996

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-ral 2901  df-rex 2902  df-in 3547  df-ss 3554  df-br 4584  df-po 4959  df-so 4960  df-fr 4997  df-we 4999

This theorem is referenced by:  fnwe2lem1  36638  aomclem1  36642  aomclem4  36645  aomclem5  36646  aomclem6  36647