Theorem weeq12d 5634

Description: Equality deduction for well-orderings. (Contributed by Stefan O'Rear, 19-Jan-2015.) (Proof shortened by Matthew House, 10-Sep-2025.)

Hypotheses

Ref	Expression
weeq12d.1	⊢ (𝜑 → 𝑅 = 𝑆)
weeq12d.2	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

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

Proof of Theorem weeq12d

Step	Hyp	Ref	Expression
1		weeq12d.1	. 2 ⊢ (𝜑 → 𝑅 = 𝑆)
2		weeq12d.2	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
3		weeq1 5632	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 We 𝐴 ↔ 𝑆 We 𝐴))
4		weeq2 5633	. . 3 ⊢ (𝐴 = 𝐵 → (𝑆 We 𝐴 ↔ 𝑆 We 𝐵))
5	3, 4	sylan9bb 517	. 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑅 We 𝐴 ↔ 𝑆 We 𝐵))
6	1, 2, 5	syl2anc 593	1 ⊢ (𝜑 → (𝑅 We 𝐴 ↔ 𝑆 We 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1559   We wwe 5597

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-ex 1799  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-ss 3921  df-br 5100  df-po 5553  df-so 5554  df-fr 5598  df-we 5600

This theorem is referenced by:  hartogslem1  9487  fpwwe2cbv  10585  fpwwe2lem2  10587  fpwwe2lem4  10589  fpwwecbv  10599  fpwwelem  10600  canthwelem  10605  canthwe  10606  pwfseqlem4  10617  fnwe2lem1  43591  aomclem1  43595  aomclem4  43598  aomclem5  43599  aomclem6  43600