ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sonr Unicode version

Theorem sonr 4072
Description: A strict order relation is irreflexive. (Contributed by NM, 24-Nov-1995.)
Assertion
Ref Expression
sonr  |-  ( ( R  Or  A  /\  B  e.  A )  ->  -.  B R B )

Proof of Theorem sonr
StepHypRef Expression
1 sopo 4068 . 2  |-  ( R  Or  A  ->  R  Po  A )
2 poirr 4062 . 2  |-  ( ( R  Po  A  /\  B  e.  A )  ->  -.  B R B )
31, 2sylan 277 1  |-  ( ( R  Or  A  /\  B  e.  A )  ->  -.  B R B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    e. wcel 1433   class class class wbr 3785    Po wpo 4049    Or wor 4050
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-po 4051  df-iso 4052
This theorem is referenced by:  sotricim  4078  sotritrieq  4080  soirri  4739  addnqprlemfl  6749  addnqprlemfu  6750  mulnqprlemfl  6765  mulnqprlemfu  6766  1ne0sr  6943
  Copyright terms: Public domain W3C validator