Theorem weso 2192

Description: A well-ordering is a strict ordering.

Assertion

Ref	Expression
weso	⊢ (R We A → R Or A)

Proof of Theorem weso

Step	Hyp	Ref	Expression
1		df-we 2186	. 2 ⊢ (R We A ↔ (R Fr A ∧ R Or A))
2	1	pm3.27bd 263	1 ⊢ (R We A → R Or A)

Syntax hints:   → wi 2   Or wor 2059   Fr wfr 2061   We wwe 2062

This theorem is referenced by:  wecmpep 2193  wetrep 2194  wereu 2197

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6

This theorem depends on definitions:  df-bi 128  df-an 198  df-we 2186

metamath.org