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

Theorem ltpopr 7498
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 7499. (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 7378 . . . . . . . 8  |-  ( s  e.  P.  ->  <. ( 1st `  s ) ,  ( 2nd `  s
) >.  e.  P. )
2 prdisj 7395 . . . . . . . 8  |-  ( (
<. ( 1st `  s
) ,  ( 2nd `  s ) >.  e.  P.  /\  q  e.  Q. )  ->  -.  ( q  e.  ( 1st `  s
)  /\  q  e.  ( 2nd `  s ) ) )
31, 2sylan 281 . . . . . . 7  |-  ( ( s  e.  P.  /\  q  e.  Q. )  ->  -.  ( q  e.  ( 1st `  s
)  /\  q  e.  ( 2nd `  s ) ) )
4 ancom 264 . . . . . . 7  |-  ( ( q  e.  ( 1st `  s )  /\  q  e.  ( 2nd `  s
) )  <->  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  s ) ) )
53, 4sylnib 666 . . . . . 6  |-  ( ( s  e.  P.  /\  q  e.  Q. )  ->  -.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  s ) ) )
65nrexdv 2550 . . . . 5  |-  ( s  e.  P.  ->  -.  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  s
) ) )
7 ltdfpr 7409 . . . . . 6  |-  ( ( s  e.  P.  /\  s  e.  P. )  ->  ( s  <P  s  <->  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  s
) ) ) )
87anidms 395 . . . . 5  |-  ( s  e.  P.  ->  (
s  <P  s  <->  E. q  e.  Q.  ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  s ) ) ) )
96, 8mtbird 663 . . . 4  |-  ( s  e.  P.  ->  -.  s  <P  s )
109adantl 275 . . 3  |-  ( ( T.  /\  s  e. 
P. )  ->  -.  s  <P  s )
11 ltdfpr 7409 . . . . . . . . . . 11  |-  ( ( s  e.  P.  /\  t  e.  P. )  ->  ( s  <P  t  <->  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t
) ) ) )
12113adant3 1002 . . . . . . . . . 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 7409 . . . . . . . . . . 11  |-  ( ( t  e.  P.  /\  u  e.  P. )  ->  ( t  <P  u  <->  E. r  e.  Q.  (
r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u
) ) ) )
14133adant1 1000 . . . . . . . . . 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 465 . . . . . . . . 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 2626 . . . . . . . . 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 197 . . . . . . . 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 294 . . . . . . 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 527 . . . . . . . . . . 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 7378 . . . . . . . . . . . . . . . . . 18  |-  ( t  e.  P.  ->  <. ( 1st `  t ) ,  ( 2nd `  t
) >.  e.  P. )
21 prltlu 7390 . . . . . . . . . . . . . . . . . 18  |-  ( (
<. ( 1st `  t
) ,  ( 2nd `  t ) >.  e.  P.  /\  q  e.  ( 1st `  t )  /\  r  e.  ( 2nd `  t
) )  ->  q  <Q  r )
2220, 21syl3an1 1253 . . . . . . . . . . . . . . . . 17  |-  ( ( t  e.  P.  /\  q  e.  ( 1st `  t )  /\  r  e.  ( 2nd `  t
) )  ->  q  <Q  r )
23223adant3r 1217 . . . . . . . . . . . . . . . 16  |-  ( ( t  e.  P.  /\  q  e.  ( 1st `  t )  /\  (
r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u
) ) )  -> 
q  <Q  r )
24233adant2l 1214 . . . . . . . . . . . . . . 15  |-  ( ( t  e.  P.  /\  ( q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) )  ->  q  <Q  r )
25243expb 1186 . . . . . . . . . . . . . 14  |-  ( ( t  e.  P.  /\  ( ( q  e.  ( 2nd `  s
)  /\  q  e.  ( 1st `  t ) )  /\  ( r  e.  ( 2nd `  t
)  /\  r  e.  ( 1st `  u ) ) ) )  -> 
q  <Q  r )
26253ad2antl2 1145 . . . . . . . . . . . . 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 469 . . . . . . . . . . . 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 7378 . . . . . . . . . . . . . . . . 17  |-  ( u  e.  P.  ->  <. ( 1st `  u ) ,  ( 2nd `  u
) >.  e.  P. )
29 prcdnql 7387 . . . . . . . . . . . . . . . . 17  |-  ( (
<. ( 1st `  u
) ,  ( 2nd `  u ) >.  e.  P.  /\  r  e.  ( 1st `  u ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
3028, 29sylan 281 . . . . . . . . . . . . . . . 16  |-  ( ( u  e.  P.  /\  r  e.  ( 1st `  u ) )  -> 
( q  <Q  r  ->  q  e.  ( 1st `  u ) ) )
3130adantrl 470 . . . . . . . . . . . . . . 15  |-  ( ( u  e.  P.  /\  ( r  e.  ( 2nd `  t )  /\  r  e.  ( 1st `  u ) ) )  ->  (
q  <Q  r  ->  q  e.  ( 1st `  u
) ) )
3231adantrl 470 . . . . . . . . . . . . . 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 1146 . . . . . . . . . . . . 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 469 . . . . . . . . . . . 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 304 . . . . . . . . . 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 114 . . . . . . . . 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 2578 . . . . . . . 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 2558 . . . . . . 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 7409 . . . . . . . . 9  |-  ( ( s  e.  P.  /\  u  e.  P. )  ->  ( s  <P  u  <->  E. q  e.  Q.  (
q  e.  ( 2nd `  s )  /\  q  e.  ( 1st `  u
) ) ) )
42413adant2 1001 . . . . . . . 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 157 . . . . . . 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 274 . . . . . 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 114 . . . 4  |-  ( ( s  e.  P.  /\  t  e.  P.  /\  u  e.  P. )  ->  (
( s  <P  t  /\  t  <P  u )  ->  s  <P  u
) )
4746adantl 275 . . 3  |-  ( ( T.  /\  ( s  e.  P.  /\  t  e.  P.  /\  u  e. 
P. ) )  -> 
( ( s  <P 
t  /\  t  <P  u )  ->  s  <P  u ) )
4810, 47ispod 4263 . 2  |-  ( T. 
->  <P  Po  P. )
4948mptru 1344 1  |-  <P  Po  P.
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 963   T. wtru 1336    e. wcel 2128   E.wrex 2436   <.cop 3563   class class class wbr 3965    Po wpo 4253   ` cfv 5167   1stc1st 6080   2ndc2nd 6081   Q.cnq 7183    <Q cltq 7188   P.cnp 7194    <P cltp 7198
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-coll 4079  ax-sep 4082  ax-nul 4090  ax-pow 4134  ax-pr 4168  ax-un 4392  ax-setind 4494  ax-iinf 4545
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-reu 2442  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-int 3808  df-iun 3851  df-br 3966  df-opab 4026  df-mpt 4027  df-tr 4063  df-eprel 4248  df-id 4252  df-po 4255  df-iso 4256  df-iord 4325  df-on 4327  df-suc 4330  df-iom 4548  df-xp 4589  df-rel 4590  df-cnv 4591  df-co 4592  df-dm 4593  df-rn 4594  df-res 4595  df-ima 4596  df-iota 5132  df-fun 5169  df-fn 5170  df-f 5171  df-f1 5172  df-fo 5173  df-f1o 5174  df-fv 5175  df-ov 5821  df-oprab 5822  df-mpo 5823  df-1st 6082  df-2nd 6083  df-recs 6246  df-irdg 6311  df-oadd 6361  df-omul 6362  df-er 6473  df-ec 6475  df-qs 6479  df-ni 7207  df-mi 7209  df-lti 7210  df-enq 7250  df-nqqs 7251  df-ltnqqs 7256  df-inp 7369  df-iltp 7373
This theorem is referenced by:  ltsopr  7499
  Copyright terms: Public domain W3C validator