Database
ZF (ZERMELO-FRAENKEL) SET THEORY
ZF Set Theory - add the Axiom of Power Sets
Partial and total orderings
sonr
Next ⟩
sotr
Metamath Proof Explorer
Ascii
Unicode
Theorem
sonr
Description:
A strict order relation is irreflexive.
(Contributed by
NM
, 24-Nov-1995)
Ref
Expression
Assertion
sonr
⊢
R
Or
A
∧
B
∈
A
→
¬
B
R
B
Proof
Step
Hyp
Ref
Expression
1
sopo
⊢
R
Or
A
→
R
Po
A
2
poirr
⊢
R
Po
A
∧
B
∈
A
→
¬
B
R
B
3
1
2
sylan
⊢
R
Or
A
∧
B
∈
A
→
¬
B
R
B