| 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 10896 | . . . . . 6 ⊢ 1o <N (1o +N 1o) | |
| 2 | 1pi 10874 | . . . . . . 7 ⊢ 1o ∈ N | |
| 3 | mulidpi 10877 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
| 5 | addclpi 10883 | . . . . . . . 8 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
| 6 | 2, 2, 5 | mp2an 704 | . . . . . . 7 ⊢ (1o +N 1o) ∈ N |
| 7 | mulidpi 10877 | . . . . . . 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 5140 | . . . . 5 ⊢ (1o ·N 1o) <N ((1o +N 1o) ·N 1o) |
| 10 | ordpipq 10933 | . . . . 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 10907 | . . . 4 ⊢ 1Q = 〈1o, 1o〉 | |
| 13 | 12, 12 | oveq12i 7424 | . . . . 5 ⊢ (1Q +pQ 1Q) = (〈1o, 1o〉 +pQ 〈1o, 1o〉) |
| 14 | addpipq 10928 | . . . . . 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 7424 | . . . . . 6 ⊢ ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o) |
| 17 | 16, 4 | opeq12i 4842 | . . . . 5 ⊢ 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 = 〈(1o +N 1o), 1o〉 |
| 18 | 13, 15, 17 | 3eqtri 2789 | . . . 4 ⊢ (1Q +pQ 1Q) = 〈(1o +N 1o), 1o〉 |
| 19 | 11, 12, 18 | 3brtr4i 5140 | . . 3 ⊢ 1Q <pQ (1Q +pQ 1Q) |
| 20 | lterpq 10961 | . . 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 10919 | . . . 4 ⊢ 1Q ∈ Q | |
| 23 | nqerid 10924 | . . . 4 ⊢ (1Q ∈ Q → ([Q]‘1Q) = 1Q) | |
| 24 | 22, 23 | ax-mp 5 | . . 3 ⊢ ([Q]‘1Q) = 1Q |
| 25 | 24 | eqcomi 2771 | . 2 ⊢ 1Q = ([Q]‘1Q) |
| 26 | addpqnq 10929 | . . 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 5140 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2142 〈cop 4594 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 1oc1o 8444 Ncnpi 10835 +N cpli 10836 ·N cmi 10837 <N clti 10838 +pQ cplpq 10839 <pQ cltpq 10841 Qcnq 10843 1Qc1q 10844 [Q]cerq 10845 +Q cplq 10846 <Q cltq 10849 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-oadd 8455 df-omul 8456 df-er 8692 df-ni 10863 df-pli 10864 df-mi 10865 df-lti 10866 df-plpq 10899 df-ltpq 10901 df-enq 10902 df-nq 10903 df-erq 10904 df-plq 10905 df-1nq 10907 df-ltnq 10909 |
| This theorem is used by: ltaddnq 10965 |
| Copyright terms: Public domain | W3C validator |