| 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 10820 | . . . . . 6 ⊢ 1o <N (1o +N 1o) | |
| 2 | 1pi 10798 | . . . . . . 7 ⊢ 1o ∈ N | |
| 3 | mulidpi 10801 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
| 5 | addclpi 10807 | . . . . . . . 8 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
| 6 | 2, 2, 5 | mp2an 693 | . . . . . . 7 ⊢ (1o +N 1o) ∈ N |
| 7 | mulidpi 10801 | . . . . . . 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 5129 | . . . . 5 ⊢ (1o ·N 1o) <N ((1o +N 1o) ·N 1o) |
| 10 | ordpipq 10857 | . . . . 5 ⊢ (〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 ↔ (1o ·N 1o) <N ((1o +N 1o) ·N 1o)) | |
| 11 | 9, 10 | mpbir 231 | . . . 4 ⊢ 〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 |
| 12 | df-1nq 10831 | . . . 4 ⊢ 1Q = 〈1o, 1o〉 | |
| 13 | 12, 12 | oveq12i 7372 | . . . . 5 ⊢ (1Q +pQ 1Q) = (〈1o, 1o〉 +pQ 〈1o, 1o〉) |
| 14 | addpipq 10852 | . . . . . 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 694 | . . . . 5 ⊢ (〈1o, 1o〉 +pQ 〈1o, 1o〉) = 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 |
| 16 | 4, 4 | oveq12i 7372 | . . . . . 6 ⊢ ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o) |
| 17 | 16, 4 | opeq12i 4835 | . . . . 5 ⊢ 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 = 〈(1o +N 1o), 1o〉 |
| 18 | 13, 15, 17 | 3eqtri 2764 | . . . 4 ⊢ (1Q +pQ 1Q) = 〈(1o +N 1o), 1o〉 |
| 19 | 11, 12, 18 | 3brtr4i 5129 | . . 3 ⊢ 1Q <pQ (1Q +pQ 1Q) |
| 20 | lterpq 10885 | . . 3 ⊢ (1Q <pQ (1Q +pQ 1Q) ↔ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q))) | |
| 21 | 19, 20 | mpbi 230 | . 2 ⊢ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q)) |
| 22 | 1nq 10843 | . . . 4 ⊢ 1Q ∈ Q | |
| 23 | nqerid 10848 | . . . 4 ⊢ (1Q ∈ Q → ([Q]‘1Q) = 1Q) | |
| 24 | 22, 23 | ax-mp 5 | . . 3 ⊢ ([Q]‘1Q) = 1Q |
| 25 | 24 | eqcomi 2746 | . 2 ⊢ 1Q = ([Q]‘1Q) |
| 26 | addpqnq 10853 | . . 3 ⊢ ((1Q ∈ Q ∧ 1Q ∈ Q) → (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q))) | |
| 27 | 22, 22, 26 | mp2an 693 | . 2 ⊢ (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q)) |
| 28 | 21, 25, 27 | 3brtr4i 5129 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 〈cop 4587 class class class wbr 5099 ‘cfv 6493 (class class class)co 7360 1oc1o 8392 Ncnpi 10759 +N cpli 10760 ·N cmi 10761 <N clti 10762 +pQ cplpq 10763 <pQ cltpq 10765 Qcnq 10767 1Qc1q 10768 [Q]cerq 10769 +Q cplq 10770 <Q cltq 10773 |
| 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 5242 ax-nul 5252 ax-pr 5378 ax-un 7682 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-omul 8404 df-er 8637 df-ni 10787 df-pli 10788 df-mi 10789 df-lti 10790 df-plpq 10823 df-ltpq 10825 df-enq 10826 df-nq 10827 df-erq 10828 df-plq 10829 df-1nq 10831 df-ltnq 10833 |
| This theorem is referenced by: ltaddnq 10889 |
| Copyright terms: Public domain | W3C validator |