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

Theorem 1lt2nq 10985
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 10917 . . . . . 6 1o <N (1o +N 1o)
2 1pi 10895 . . . . . . 7 1oN
3 mulidpi 10898 . . . . . . 7 (1oN → (1o ·N 1o) = 1o)
42, 3ax-mp 5 . . . . . 6 (1o ·N 1o) = 1o
5 addclpi 10904 . . . . . . . 8 ((1oN ∧ 1oN) → (1o +N 1o) ∈ N)
62, 2, 5mp2an 705 . . . . . . 7 (1o +N 1o) ∈ N
7 mulidpi 10898 . . . . . . 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 5139 . . . . 5 (1o ·N 1o) <N ((1o +N 1o) ·N 1o)
10 ordpipq 10954 . . . . 5 (⟨1o, 1o⟩ <pQ ⟨(1o +N 1o), 1o⟩ ↔ (1o ·N 1o) <N ((1o +N 1o) ·N 1o))
119, 10mpbir 234 . . . 4 ⟨1o, 1o⟩ <pQ ⟨(1o +N 1o), 1o
12 df-1nq 10928 . . . 4 1Q = ⟨1o, 1o
1312, 12oveq12i 7428 . . . . 5 (1Q +pQ 1Q) = (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩)
14 addpipq 10949 . . . . . 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 706 . . . . 5 (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩) = ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩
164, 4oveq12i 7428 . . . . . 6 ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o)
1716, 4opeq12i 4841 . . . . 5 ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩ = ⟨(1o +N 1o), 1o
1813, 15, 173eqtri 2789 . . . 4 (1Q +pQ 1Q) = ⟨(1o +N 1o), 1o
1911, 12, 183brtr4i 5139 . . 3 1Q <pQ (1Q +pQ 1Q)
20 lterpq 10982 . . 3 (1Q <pQ (1Q +pQ 1Q) ↔ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q)))
2119, 20mpbi 233 . 2 ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q))
22 1nq 10940 . . . 4 1QQ
23 nqerid 10945 . . . 4 (1QQ → ([Q]‘1Q) = 1Q)
2422, 23ax-mp 5 . . 3 ([Q]‘1Q) = 1Q
2524eqcomi 2771 . 2 1Q = ([Q]‘1Q)
26 addpqnq 10950 . . 3 ((1QQ ∧ 1QQ) → (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q)))
2722, 22, 26mp2an 705 . 2 (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q))
2821, 25, 273brtr4i 5139 1 1Q <Q (1Q +Q 1Q)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2145  cop 4593   class class class wbr 5107  cfv 6537  (class class class)co 7416  1oc1o 8451  Ncnpi 10856   +N cpli 10857   ·N cmi 10858   <N clti 10859   +pQ cplpq 10860   <pQ cltpq 10862  Qcnq 10864  1Qc1q 10865  [Q]cerq 10866   +Q cplq 10867   <Q cltq 10870
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-oadd 8462  df-omul 8463  df-er 8699  df-ni 10884  df-pli 10885  df-mi 10886  df-lti 10887  df-plpq 10920  df-ltpq 10922  df-enq 10923  df-nq 10924  df-erq 10925  df-plq 10926  df-1nq 10928  df-ltnq 10930
This theorem is used by:  ltaddnq  10986
  Copyright terms: Public domain W3C validator