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

Theorem 1lt2nq 10896
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 10828 . . . . . 6 1o <N (1o +N 1o)
2 1pi 10806 . . . . . . 7 1oN
3 mulidpi 10809 . . . . . . 7 (1oN → (1o ·N 1o) = 1o)
42, 3ax-mp 5 . . . . . 6 (1o ·N 1o) = 1o
5 addclpi 10815 . . . . . . . 8 ((1oN ∧ 1oN) → (1o +N 1o) ∈ N)
62, 2, 5mp2an 693 . . . . . . 7 (1o +N 1o) ∈ N
7 mulidpi 10809 . . . . . . 7 ((1o +N 1o) ∈ 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 5116 . . . . 5 (1o ·N 1o) <N ((1o +N 1o) ·N 1o)
10 ordpipq 10865 . . . . 5 (⟨1o, 1o⟩ <pQ ⟨(1o +N 1o), 1o⟩ ↔ (1o ·N 1o) <N ((1o +N 1o) ·N 1o))
119, 10mpbir 231 . . . 4 ⟨1o, 1o⟩ <pQ ⟨(1o +N 1o), 1o
12 df-1nq 10839 . . . 4 1Q = ⟨1o, 1o
1312, 12oveq12i 7379 . . . . 5 (1Q +pQ 1Q) = (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩)
14 addpipq 10860 . . . . . 6 (((1oN ∧ 1oN) ∧ (1oN ∧ 1oN)) → (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩) = ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩)
152, 2, 2, 2, 14mp4an 694 . . . . 5 (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩) = ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩
164, 4oveq12i 7379 . . . . . 6 ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o)
1716, 4opeq12i 4822 . . . . 5 ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩ = ⟨(1o +N 1o), 1o
1813, 15, 173eqtri 2764 . . . 4 (1Q +pQ 1Q) = ⟨(1o +N 1o), 1o
1911, 12, 183brtr4i 5116 . . 3 1Q <pQ (1Q +pQ 1Q)
20 lterpq 10893 . . 3 (1Q <pQ (1Q +pQ 1Q) ↔ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q)))
2119, 20mpbi 230 . 2 ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q))
22 1nq 10851 . . . 4 1QQ
23 nqerid 10856 . . . 4 (1QQ → ([Q]‘1Q) = 1Q)
2422, 23ax-mp 5 . . 3 ([Q]‘1Q) = 1Q
2524eqcomi 2746 . 2 1Q = ([Q]‘1Q)
26 addpqnq 10861 . . 3 ((1QQ ∧ 1QQ) → (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q)))
2722, 22, 26mp2an 693 . 2 (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q))
2821, 25, 273brtr4i 5116 1 1Q <Q (1Q +Q 1Q)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  wcel 2114  cop 4574   class class class wbr 5086  cfv 6499  (class class class)co 7367  1oc1o 8398  Ncnpi 10767   +N cpli 10768   ·N cmi 10769   <N clti 10770   +pQ cplpq 10771   <pQ cltpq 10773  Qcnq 10775  1Qc1q 10776  [Q]cerq 10777   +Q cplq 10778   <Q cltq 10781
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6266  df-ord 6327  df-on 6328  df-lim 6329  df-suc 6330  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-omul 8410  df-er 8643  df-ni 10795  df-pli 10796  df-mi 10797  df-lti 10798  df-plpq 10831  df-ltpq 10833  df-enq 10834  df-nq 10835  df-erq 10836  df-plq 10837  df-1nq 10839  df-ltnq 10841
This theorem is referenced by:  ltaddnq  10897
  Copyright terms: Public domain W3C validator