Theorem weeq2 2944

Description: Equality theorem for the well-ordering predicate.

Assertion

Ref	Expression
weeq2	⊢ (A = B → (R We A ↔ R We B))

Proof of Theorem weeq2

Step	Hyp	Ref	Expression
1		freq2 2929	. . 3 ⊢ (A = B → (R Fr A ↔ R Fr B))
2		soeq2 2860	. . 3 ⊢ (A = B → (R Or A ↔ R Or B))
3	1, 2	anbi12d 630	. 2 ⊢ (A = B → ((R Fr A ⋀ R Or A) ↔ (R Fr B ⋀ R Or B)))
4		df-we 2940	. 2 ⊢ (R We A ↔ (R Fr A ⋀ R Or A))
5		df-we 2940	. 2 ⊢ (R We B ↔ (R Fr B ⋀ R Or B))
6	3, 4, 5	3bitr4g 557	1 ⊢ (A = B → (R We A ↔ R We B))

Syntax hints:   → wi 3   ↔ wb 146   ⋀ wa 223   = wceq 958   Or wor 2845   Fr wfr 2921   We wwe 2922

This theorem is referenced by:  ordeq 2961  hta 4738

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 779  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-po 2846  df-so 2856  df-fr 2923  df-we 2940

Copyright terms: Public domain