ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  1lt2nq GIF version

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

Proof of Theorem 1lt2nq
StepHypRef Expression
1 1lt2pi 7243 . . . . 5 1o <N (1o +N 1o)
2 1pi 7218 . . . . . 6 1oN
3 mulidpi 7221 . . . . . 6 (1oN → (1o ·N 1o) = 1o)
42, 3ax-mp 5 . . . . 5 (1o ·N 1o) = 1o
54, 4oveq12i 5830 . . . . 5 ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o)
61, 4, 53brtr4i 3994 . . . 4 (1o ·N 1o) <N ((1o ·N 1o) +N (1o ·N 1o))
7 mulclpi 7231 . . . . . 6 ((1oN ∧ 1oN) → (1o ·N 1o) ∈ N)
82, 2, 7mp2an 423 . . . . 5 (1o ·N 1o) ∈ N
9 addclpi 7230 . . . . . 6 (((1o ·N 1o) ∈ N ∧ (1o ·N 1o) ∈ N) → ((1o ·N 1o) +N (1o ·N 1o)) ∈ N)
108, 8, 9mp2an 423 . . . . 5 ((1o ·N 1o) +N (1o ·N 1o)) ∈ N
11 ltmpig 7242 . . . . 5 (((1o ·N 1o) ∈ N ∧ ((1o ·N 1o) +N (1o ·N 1o)) ∈ N ∧ 1oN) → ((1o ·N 1o) <N ((1o ·N 1o) +N (1o ·N 1o)) ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o)))))
128, 10, 2, 11mp3an 1319 . . . 4 ((1o ·N 1o) <N ((1o ·N 1o) +N (1o ·N 1o)) ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o))))
136, 12mpbi 144 . . 3 (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o)))
14 ordpipqqs 7277 . . . 4 (((1oN ∧ 1oN) ∧ (((1o ·N 1o) +N (1o ·N 1o)) ∈ N ∧ (1o ·N 1o) ∈ N)) → ([⟨1o, 1o⟩] ~Q <Q [⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o)))))
152, 2, 10, 8, 14mp4an 424 . . 3 ([⟨1o, 1o⟩] ~Q <Q [⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o))))
1613, 15mpbir 145 . 2 [⟨1o, 1o⟩] ~Q <Q [⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q
17 df-1nqqs 7254 . 2 1Q = [⟨1o, 1o⟩] ~Q
1817, 17oveq12i 5830 . . 3 (1Q +Q 1Q) = ([⟨1o, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q )
19 addpipqqs 7273 . . . 4 (((1oN ∧ 1oN) ∧ (1oN ∧ 1oN)) → ([⟨1o, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
202, 2, 2, 2, 19mp4an 424 . . 3 ([⟨1o, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q
2118, 20eqtri 2178 . 2 (1Q +Q 1Q) = [⟨((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q
2216, 17, 213brtr4i 3994 1 1Q <Q (1Q +Q 1Q)
Colors of variables: wff set class
Syntax hints:  wb 104   = wceq 1335  wcel 2128  cop 3563   class class class wbr 3965  (class class class)co 5818  1oc1o 6350  [cec 6471  Ncnpi 7175   +N cpli 7176   ·N cmi 7177   <N clti 7178   ~Q ceq 7182  1Qc1q 7184   +Q cplq 7185   <Q cltq 7188
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-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-1o 6357  df-oadd 6361  df-omul 6362  df-er 6473  df-ec 6475  df-qs 6479  df-ni 7207  df-pli 7208  df-mi 7209  df-lti 7210  df-plpq 7247  df-enq 7250  df-nqqs 7251  df-plqqs 7252  df-1nqqs 7254  df-ltnqqs 7256
This theorem is referenced by:  ltaddnq  7310
  Copyright terms: Public domain W3C validator