| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1lt2nq | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| 1lt2nq | ⊢ 1Q <Q (1Q +Q 1Q) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1lt2pi 10878 | . . . . . 6 ⊢ 1o <N (1o +N 1o) | |
| 2 | 1pi 10856 | . . . . . . 7 ⊢ 1o ∈ N | |
| 3 | mulidpi 10859 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
| 5 | addclpi 10865 | . . . . . . . 8 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
| 6 | 2, 2, 5 | mp2an 704 | . . . . . . 7 ⊢ (1o +N 1o) ∈ N |
| 7 | mulidpi 10859 | . . . . . . 7 ⊢ ((1o +N 1o) ∈ N → ((1o +N 1o) ·N 1o) = (1o +N 1o)) | |
| 8 | 6, 7 | ax-mp 5 | . . . . . 6 ⊢ ((1o +N 1o) ·N 1o) = (1o +N 1o) |
| 9 | 1, 4, 8 | 3brtr4i 5135 | . . . . 5 ⊢ (1o ·N 1o) <N ((1o +N 1o) ·N 1o) |
| 10 | ordpipq 10915 | . . . . 5 ⊢ (〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 ↔ (1o ·N 1o) <N ((1o +N 1o) ·N 1o)) | |
| 11 | 9, 10 | mpbir 234 | . . . 4 ⊢ 〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 |
| 12 | df-1nq 10889 | . . . 4 ⊢ 1Q = 〈1o, 1o〉 | |
| 13 | 12, 12 | oveq12i 7412 | . . . . 5 ⊢ (1Q +pQ 1Q) = (〈1o, 1o〉 +pQ 〈1o, 1o〉) |
| 14 | addpipq 10910 | . . . . . 6 ⊢ (((1o ∈ N ∧ 1o ∈ N) ∧ (1o ∈ N ∧ 1o ∈ N)) → (〈1o, 1o〉 +pQ 〈1o, 1o〉) = 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉) | |
| 15 | 2, 2, 2, 2, 14 | mp4an 705 | . . . . 5 ⊢ (〈1o, 1o〉 +pQ 〈1o, 1o〉) = 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 |
| 16 | 4, 4 | oveq12i 7412 | . . . . . 6 ⊢ ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o) |
| 17 | 16, 4 | opeq12i 4839 | . . . . 5 ⊢ 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 = 〈(1o +N 1o), 1o〉 |
| 18 | 13, 15, 17 | 3eqtri 2792 | . . . 4 ⊢ (1Q +pQ 1Q) = 〈(1o +N 1o), 1o〉 |
| 19 | 11, 12, 18 | 3brtr4i 5135 | . . 3 ⊢ 1Q <pQ (1Q +pQ 1Q) |
| 20 | lterpq 10943 | . . 3 ⊢ (1Q <pQ (1Q +pQ 1Q) ↔ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q))) | |
| 21 | 19, 20 | mpbi 233 | . 2 ⊢ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q)) |
| 22 | 1nq 10901 | . . . 4 ⊢ 1Q ∈ Q | |
| 23 | nqerid 10906 | . . . 4 ⊢ (1Q ∈ Q → ([Q]‘1Q) = 1Q) | |
| 24 | 22, 23 | ax-mp 5 | . . 3 ⊢ ([Q]‘1Q) = 1Q |
| 25 | 24 | eqcomi 2774 | . 2 ⊢ 1Q = ([Q]‘1Q) |
| 26 | addpqnq 10911 | . . 3 ⊢ ((1Q ∈ Q ∧ 1Q ∈ Q) → (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q))) | |
| 27 | 22, 22, 26 | mp2an 704 | . 2 ⊢ (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q)) |
| 28 | 21, 25, 27 | 3brtr4i 5135 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1563 ∈ wcel 2145 〈cop 4591 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 1oc1o 8434 Ncnpi 10817 +N cpli 10818 ·N cmi 10819 <N clti 10820 +pQ cplpq 10821 <pQ cltpq 10823 Qcnq 10825 1Qc1q 10826 [Q]cerq 10827 +Q cplq 10828 <Q cltq 10831 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-oadd 8445 df-omul 8446 df-er 8682 df-ni 10845 df-pli 10846 df-mi 10847 df-lti 10848 df-plpq 10881 df-ltpq 10883 df-enq 10884 df-nq 10885 df-erq 10886 df-plq 10887 df-1nq 10889 df-ltnq 10891 |
| This theorem is referenced by: ltaddnq 10947 |
| Copyright terms: Public domain | W3C validator |