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

Theorem 1lt2nq 10874
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 10806 . . . . . 6 1o <N (1o +N 1o)
2 1pi 10784 . . . . . . 7 1oN
3 mulidpi 10787 . . . . . . 7 (1oN → (1o ·N 1o) = 1o)
42, 3ax-mp 5 . . . . . 6 (1o ·N 1o) = 1o
5 addclpi 10793 . . . . . . . 8 ((1oN ∧ 1oN) → (1o +N 1o) ∈ N)
62, 2, 5mp2an 692 . . . . . . 7 (1o +N 1o) ∈ N
7 mulidpi 10787 . . . . . . 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 5125 . . . . 5 (1o ·N 1o) <N ((1o +N 1o) ·N 1o)
10 ordpipq 10843 . . . . 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 10817 . . . 4 1Q = ⟨1o, 1o
1312, 12oveq12i 7367 . . . . 5 (1Q +pQ 1Q) = (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩)
14 addpipq 10838 . . . . . 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 693 . . . . 5 (⟨1o, 1o⟩ +pQ ⟨1o, 1o⟩) = ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩
164, 4oveq12i 7367 . . . . . 6 ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o)
1716, 4opeq12i 4831 . . . . 5 ⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩ = ⟨(1o +N 1o), 1o
1813, 15, 173eqtri 2760 . . . 4 (1Q +pQ 1Q) = ⟨(1o +N 1o), 1o
1911, 12, 183brtr4i 5125 . . 3 1Q <pQ (1Q +pQ 1Q)
20 lterpq 10871 . . 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 10829 . . . 4 1QQ
23 nqerid 10834 . . . 4 (1QQ → ([Q]‘1Q) = 1Q)
2422, 23ax-mp 5 . . 3 ([Q]‘1Q) = 1Q
2524eqcomi 2742 . 2 1Q = ([Q]‘1Q)
26 addpqnq 10839 . . 3 ((1QQ ∧ 1QQ) → (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q)))
2722, 22, 26mp2an 692 . 2 (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q))
2821, 25, 273brtr4i 5125 1 1Q <Q (1Q +Q 1Q)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wcel 2113  cop 4583   class class class wbr 5095  cfv 6489  (class class class)co 7355  1oc1o 8387  Ncnpi 10745   +N cpli 10746   ·N cmi 10747   <N clti 10748   +pQ cplpq 10749   <pQ cltpq 10751  Qcnq 10753  1Qc1q 10754  [Q]cerq 10755   +Q cplq 10756   <Q cltq 10759
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7677
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-oadd 8398  df-omul 8399  df-er 8631  df-ni 10773  df-pli 10774  df-mi 10775  df-lti 10776  df-plpq 10809  df-ltpq 10811  df-enq 10812  df-nq 10813  df-erq 10814  df-plq 10815  df-1nq 10817  df-ltnq 10819
This theorem is referenced by:  ltaddnq  10875
  Copyright terms: Public domain W3C validator