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

Theorem ltpopr 7962
Description: Positive real 'less than' is a partial ordering. Remark ("< is transitive and irreflexive") preceding Proposition 11.2.3 of [HoTT], p. (varies). Lemma for ltsopr 7963. (Contributed by Jim Kingdon, 15-Dec-2019.)
Assertion
Ref Expression
ltpopr  |-  <P  Po  P.

Proof of Theorem ltpopr
Dummy variables  r  q  s  t  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prop 7842 . . . . . . . 8  |-  ( s  e.  P.  ->  <. ( 1st `  s ) ,  ( 2nd `  s
) >.  e.  P. )
2 prdisj 7859 . . . . . . . 8  |-  ( (
<. ( 1st `  s
) ,  ( 2nd `  s ) >.  e.  P.  /\  q  e.  Q. )  ->  -.  ( q  e.  ( 1st `  s
)  /\  q  e.  ( 2nd `  s ) ) )
31, 2sylan 283 . . . . . . 7  |-  ( ( s  e.  P.  /\  q  e.  Q. )  ->  -.  ( q  e.  ( 1st `  s
)  /\  q  e.  ( 2nd `  s ) ) )
4 ancom 266 . . . . . . 7  |-  ( ( q  e.  ( 1st `  s )  /\  q  e.  ( 2nd `  s
) )  <->  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  s ) ) )
53, 4sylnib 687 . . . . . 6  |-  ( ( s  e.  P.  /\  q  e.  Q. )  ->  -.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  s ) ) )
65nrexdv 2643 . . . . 5  |-  ( s  e.  P.  ->  -.  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  s
) ) )
7 ltdfpr 7873 . . . . . 6  |-  ( ( s  e.  P.  /\  s  e.  P. )  ->  ( s  <P  s  <->  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  s
) ) ) )
87anidms 401 . . . . 5  |-  ( s  e.  P.  ->  (
s  <P  s  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  s ) ) ) )
96, 8mtbird 684 . . . 4  |-  ( s  e.  P.  ->  -.  s  <P  s )
109adantl 277 . . 3  |-  ( ( T.  /\  s  e. 
P. )  ->  -.  s  <P  s )
11 ltdfpr 7873 . . . . . . . . . . 11  |-  ( ( s  e.  P.  /\  t  e.  P. )  ->  ( s  <P  t  <->  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t
) ) ) )
12113adant3 1048 . . . . . . . . . 10  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
s  <P  t  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) ) ) )
13 ltdfpr 7873 . . . . . . . . . . 11  |-  ( ( t  e.  P.  /\  u  e.  P. )  ->  ( t  <P  u  <->  E. r  e.  Q.  (
r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u
) ) ) )
14133adant1 1046 . . . . . . . . . 10  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
t  <P  u  <->  E. r  e.  Q.  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )
1512, 14anbi12d 477 . . . . . . . . 9  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
( s  <P  t  /\  t  <P  u )  <-> 
( E. q  e. 
Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  E. r  e.  Q.  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) ) )
16 reeanv 2721 . . . . . . . . 9  |-  ( E. q  e.  Q.  E. r  e.  Q.  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) )  <->  ( E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t
) )  /\  E. r  e.  Q.  (
r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u
) ) ) )
1715, 16bitr4di 198 . . . . . . . 8  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
( s  <P  t  /\  t  <P  u )  <->  E. q  e.  Q.  E. r  e.  Q.  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) ) )
1817biimpa 296 . . . . . . 7  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  E. q  e.  Q.  E. r  e. 
Q.  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )
19 simprll 543 . . . . . . . . . . 11  |-  ( ( ( ( s  e. 
P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P 
t  /\  t  <P  u ) )  /\  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
q  e.  ( 2nd `  s ) )
20 prop 7842 . . . . . . . . . . . . . . . . . 18  |-  ( t  e.  P.  ->  <. ( 1st `  t ) ,  ( 2nd `  t
) >.  e.  P. )
21 prltlu 7854 . . . . . . . . . . . . . . . . . 18  |-  ( (
<. ( 1st `  t
) ,  ( 2nd `  t ) >.  e.  P.  /\  q  e.  ( 1st `  t )  /\  r  e.  ( 2nd `  t
) )  ->  q  <Q  r )
2220, 21syl3an1 1311 . . . . . . . . . . . . . . . . 17  |-  ( ( t  e.  P.  /\  q  e.  ( 1st `  t )  /\  r  e.  ( 2nd `  t
) )  ->  q  <Q  r )
23223adant3r 1266 . . . . . . . . . . . . . . . 16  |-  ( ( t  e.  P.  /\  q  e.  ( 1st `  t )  /\  (
r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u
) ) )  -> 
q  <Q  r )
24233adant2l 1263 . . . . . . . . . . . . . . 15  |-  ( ( t  e.  P.  /\  ( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) )  ->  q  <Q  r )
25243expb 1235 . . . . . . . . . . . . . 14  |-  ( ( t  e.  P.  /\  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
q  <Q  r )
26253ad2antl2 1191 . . . . . . . . . . . . 13  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
q  <Q  r )
2726adantlr 481 . . . . . . . . . . . 12  |-  ( ( ( ( s  e. 
P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P 
t  /\  t  <P  u ) )  /\  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
q  <Q  r )
28 prop 7842 . . . . . . . . . . . . . . . . 17  |-  ( u  e.  P.  ->  <. ( 1st `  u ) ,  ( 2nd `  u
) >.  e.  P. )
29 prcdnql 7851 . . . . . . . . . . . . . . . . 17  |-  ( (
<. ( 1st `  u
) ,  ( 2nd `  u ) >.  e.  P.  /\  r  e.  ( 1st `  u ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
3028, 29sylan 283 . . . . . . . . . . . . . . . 16  |-  ( ( u  e.  P.  /\  r  e.  ( 1st `  u ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
3130adantrl 482 . . . . . . . . . . . . . . 15  |-  ( ( u  e.  P.  /\  ( r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u ) ) )  ->  (
q  <Q  r  ->  q  e.  ( 1st `  u
) ) )
3231adantrl 482 . . . . . . . . . . . . . 14  |-  ( ( u  e.  P.  /\  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
33323ad2antl3 1192 . . . . . . . . . . . . 13  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
3433adantlr 481 . . . . . . . . . . . 12  |-  ( ( ( ( s  e. 
P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P 
t  /\  t  <P  u ) )  /\  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
3527, 34mpd 13 . . . . . . . . . . 11  |-  ( ( ( ( s  e. 
P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P 
t  /\  t  <P  u ) )  /\  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
q  e.  ( 1st `  u ) )
3619, 35jca 306 . . . . . . . . . 10  |-  ( ( ( ( s  e. 
P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P 
t  /\  t  <P  u ) )  /\  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u ) ) )
3736ex 115 . . . . . . . . 9  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  ( (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) )  ->  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u
) ) ) )
3837rexlimdvw 2672 . . . . . . . 8  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  ( E. r  e.  Q.  (
( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) )  ->  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u
) ) ) )
3938reximdv 2651 . . . . . . 7  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  ( E. q  e.  Q.  E. r  e.  Q.  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) )  ->  E. q  e.  Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  u ) ) ) )
4018, 39mpd 13 . . . . . 6  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  E. q  e.  Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  u ) ) )
41 ltdfpr 7873 . . . . . . . . 9  |-  ( ( s  e.  P.  /\  u  e.  P. )  ->  ( s  <P  u  <->  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u
) ) ) )
42413adant2 1047 . . . . . . . 8  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
s  <P  u  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  u ) ) ) )
4342biimprd 158 . . . . . . 7  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  ( E. q  e.  Q.  ( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u ) )  ->  s  <P  u ) )
4443adantr 276 . . . . . 6  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  ( E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u
) )  ->  s  <P  u ) )
4540, 44mpd 13 . . . . 5  |-  ( ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  /\  ( s  <P  t  /\  t  <P  u ) )  ->  s  <P  u )
4645ex 115 . . . 4  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
( s  <P  t  /\  t  <P  u )  ->  s  <P  u
) )
4746adantl 277 . . 3  |-  ( ( T.  /\  ( s  e.  P.  /\  t  e.  P.  /\  u  e. 
P. ) )  -> 
( ( s  <P 
t  /\  t  <P  u )  ->  s  <P  u ) )
4810, 47ispod 4449 . 2  |-  ( T. 
->  <P  Po  P. )
4948mptru 1411 1  |-  <P  Po  P.
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009   T. wtru 1403    e. wcel 2209   E.wrex 2529   <.cop 3712   class class class wbr 4130    Po wpo 4439   ` cfv 5377   1stc1st 6372   2ndc2nd 6373   Q.cnq 7647    <Q cltq 7652   P.cnp 7658    <P cltp 7662
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-mi 7673  df-lti 7674  df-enq 7714  df-nqqs 7715  df-ltnqqs 7720  df-inp 7833  df-iltp 7837
This theorem is used by:  ltsopr  7963
  Copyright terms: Public domain W3C validator