MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  1lt2nq Structured version   Unicode version

Theorem 1lt2nq 9349
Description: One is less than two (one plus one). (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
1lt2nq  |-  1Q  <Q  ( 1Q  +Q  1Q )

Proof of Theorem 1lt2nq
StepHypRef Expression
1 1lt2pi 9281 . . . . . 6  |-  1o  <N  ( 1o  +N  1o )
2 1pi 9259 . . . . . . 7  |-  1o  e.  N.
3 mulidpi 9262 . . . . . . 7  |-  ( 1o  e.  N.  ->  ( 1o  .N  1o )  =  1o )
42, 3ax-mp 5 . . . . . 6  |-  ( 1o 
.N  1o )  =  1o
5 addclpi 9268 . . . . . . . 8  |-  ( ( 1o  e.  N.  /\  1o  e.  N. )  -> 
( 1o  +N  1o )  e.  N. )
62, 2, 5mp2an 672 . . . . . . 7  |-  ( 1o 
+N  1o )  e. 
N.
7 mulidpi 9262 . . . . . . 7  |-  ( ( 1o  +N  1o )  e.  N.  ->  (
( 1o  +N  1o )  .N  1o )  =  ( 1o  +N  1o ) )
86, 7ax-mp 5 . . . . . 6  |-  ( ( 1o  +N  1o )  .N  1o )  =  ( 1o  +N  1o )
91, 4, 83brtr4i 4461 . . . . 5  |-  ( 1o 
.N  1o )  <N 
( ( 1o  +N  1o )  .N  1o )
10 ordpipq 9318 . . . . 5  |-  ( <. 1o ,  1o >.  <pQ  <. ( 1o  +N  1o ) ,  1o >.  <->  ( 1o  .N  1o )  <N  ( ( 1o  +N  1o )  .N  1o ) )
119, 10mpbir 209 . . . 4  |-  <. 1o ,  1o >.  <pQ  <. ( 1o  +N  1o ) ,  1o >.
12 df-1nq 9292 . . . 4  |-  1Q  =  <. 1o ,  1o >.
1312, 12oveq12i 6289 . . . . 5  |-  ( 1Q 
+pQ  1Q )  =  (
<. 1o ,  1o >.  +pQ 
<. 1o ,  1o >. )
14 addpipq 9313 . . . . . 6  |-  ( ( ( 1o  e.  N.  /\  1o  e.  N. )  /\  ( 1o  e.  N.  /\  1o  e.  N. )
)  ->  ( <. 1o ,  1o >.  +pQ  <. 1o ,  1o >. )  =  <. ( ( 1o  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>. )
152, 2, 2, 2, 14mp4an 673 . . . . 5  |-  ( <. 1o ,  1o >.  +pQ  <. 1o ,  1o >. )  =  <. ( ( 1o  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>.
164, 4oveq12i 6289 . . . . . 6  |-  ( ( 1o  .N  1o )  +N  ( 1o  .N  1o ) )  =  ( 1o  +N  1o )
1716, 4opeq12i 4203 . . . . 5  |-  <. (
( 1o  .N  1o )  +N  ( 1o  .N  1o ) ) ,  ( 1o  .N  1o )
>.  =  <. ( 1o 
+N  1o ) ,  1o >.
1813, 15, 173eqtri 2474 . . . 4  |-  ( 1Q 
+pQ  1Q )  =  <. ( 1o  +N  1o ) ,  1o >.
1911, 12, 183brtr4i 4461 . . 3  |-  1Q  <pQ  ( 1Q  +pQ  1Q )
20 lterpq 9346 . . 3  |-  ( 1Q 
<pQ  ( 1Q  +pQ  1Q ) 
<->  ( /Q `  1Q )  <Q  ( /Q `  ( 1Q  +pQ  1Q ) ) )
2119, 20mpbi 208 . 2  |-  ( /Q
`  1Q )  <Q 
( /Q `  ( 1Q  +pQ  1Q ) )
22 1nq 9304 . . . 4  |-  1Q  e.  Q.
23 nqerid 9309 . . . 4  |-  ( 1Q  e.  Q.  ->  ( /Q `  1Q )  =  1Q )
2422, 23ax-mp 5 . . 3  |-  ( /Q
`  1Q )  =  1Q
2524eqcomi 2454 . 2  |-  1Q  =  ( /Q `  1Q )
26 addpqnq 9314 . . 3  |-  ( ( 1Q  e.  Q.  /\  1Q  e.  Q. )  -> 
( 1Q  +Q  1Q )  =  ( /Q `  ( 1Q  +pQ  1Q ) ) )
2722, 22, 26mp2an 672 . 2  |-  ( 1Q 
+Q  1Q )  =  ( /Q `  ( 1Q  +pQ  1Q ) )
2821, 25, 273brtr4i 4461 1  |-  1Q  <Q  ( 1Q  +Q  1Q )
Colors of variables: wff setvar class
Syntax hints:    = wceq 1381    e. wcel 1802   <.cop 4016   class class class wbr 4433   ` cfv 5574  (class class class)co 6277   1oc1o 7121   N.cnpi 9220    +N cpli 9221    .N cmi 9222    <N clti 9223    +pQ cplpq 9224    <pQ cltpq 9226   Q.cnq 9228   1Qc1q 9229   /Qcerq 9230    +Q cplq 9231    <Q cltq 9234
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1603  ax-4 1616  ax-5 1689  ax-6 1732  ax-7 1774  ax-8 1804  ax-9 1806  ax-10 1821  ax-11 1826  ax-12 1838  ax-13 1983  ax-ext 2419  ax-sep 4554  ax-nul 4562  ax-pow 4611  ax-pr 4672  ax-un 6573
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 973  df-3an 974  df-tru 1384  df-ex 1598  df-nf 1602  df-sb 1725  df-eu 2270  df-mo 2271  df-clab 2427  df-cleq 2433  df-clel 2436  df-nfc 2591  df-ne 2638  df-ral 2796  df-rex 2797  df-reu 2798  df-rmo 2799  df-rab 2800  df-v 3095  df-sbc 3312  df-csb 3418  df-dif 3461  df-un 3463  df-in 3465  df-ss 3472  df-pss 3474  df-nul 3768  df-if 3923  df-pw 3995  df-sn 4011  df-pr 4013  df-tp 4015  df-op 4017  df-uni 4231  df-iun 4313  df-br 4434  df-opab 4492  df-mpt 4493  df-tr 4527  df-eprel 4777  df-id 4781  df-po 4786  df-so 4787  df-fr 4824  df-we 4826  df-ord 4867  df-on 4868  df-lim 4869  df-suc 4870  df-xp 4991  df-rel 4992  df-cnv 4993  df-co 4994  df-dm 4995  df-rn 4996  df-res 4997  df-ima 4998  df-iota 5537  df-fun 5576  df-fn 5577  df-f 5578  df-f1 5579  df-fo 5580  df-f1o 5581  df-fv 5582  df-ov 6280  df-oprab 6281  df-mpt2 6282  df-om 6682  df-1st 6781  df-2nd 6782  df-recs 7040  df-rdg 7074  df-1o 7128  df-oadd 7132  df-omul 7133  df-er 7309  df-ni 9248  df-pli 9249  df-mi 9250  df-lti 9251  df-plpq 9284  df-ltpq 9286  df-enq 9287  df-nq 9288  df-erq 9289  df-plq 9290  df-1nq 9292  df-ltnq 9294
This theorem is referenced by:  ltaddnq  9350
  Copyright terms: Public domain W3C validator