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 10327 | . . . . . 6 ⊢ 1o <N (1o +N 1o) | |
2 | 1pi 10305 | . . . . . . 7 ⊢ 1o ∈ N | |
3 | mulidpi 10308 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
5 | addclpi 10314 | . . . . . . . 8 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
6 | 2, 2, 5 | mp2an 690 | . . . . . . 7 ⊢ (1o +N 1o) ∈ N |
7 | mulidpi 10308 | . . . . . . 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 5096 | . . . . 5 ⊢ (1o ·N 1o) <N ((1o +N 1o) ·N 1o) |
10 | ordpipq 10364 | . . . . 5 ⊢ (〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 ↔ (1o ·N 1o) <N ((1o +N 1o) ·N 1o)) | |
11 | 9, 10 | mpbir 233 | . . . 4 ⊢ 〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 |
12 | df-1nq 10338 | . . . 4 ⊢ 1Q = 〈1o, 1o〉 | |
13 | 12, 12 | oveq12i 7168 | . . . . 5 ⊢ (1Q +pQ 1Q) = (〈1o, 1o〉 +pQ 〈1o, 1o〉) |
14 | addpipq 10359 | . . . . . 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 691 | . . . . 5 ⊢ (〈1o, 1o〉 +pQ 〈1o, 1o〉) = 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 |
16 | 4, 4 | oveq12i 7168 | . . . . . 6 ⊢ ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o) |
17 | 16, 4 | opeq12i 4808 | . . . . 5 ⊢ 〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 = 〈(1o +N 1o), 1o〉 |
18 | 13, 15, 17 | 3eqtri 2848 | . . . 4 ⊢ (1Q +pQ 1Q) = 〈(1o +N 1o), 1o〉 |
19 | 11, 12, 18 | 3brtr4i 5096 | . . 3 ⊢ 1Q <pQ (1Q +pQ 1Q) |
20 | lterpq 10392 | . . 3 ⊢ (1Q <pQ (1Q +pQ 1Q) ↔ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q))) | |
21 | 19, 20 | mpbi 232 | . 2 ⊢ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q)) |
22 | 1nq 10350 | . . . 4 ⊢ 1Q ∈ Q | |
23 | nqerid 10355 | . . . 4 ⊢ (1Q ∈ Q → ([Q]‘1Q) = 1Q) | |
24 | 22, 23 | ax-mp 5 | . . 3 ⊢ ([Q]‘1Q) = 1Q |
25 | 24 | eqcomi 2830 | . 2 ⊢ 1Q = ([Q]‘1Q) |
26 | addpqnq 10360 | . . 3 ⊢ ((1Q ∈ Q ∧ 1Q ∈ Q) → (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q))) | |
27 | 22, 22, 26 | mp2an 690 | . 2 ⊢ (1Q +Q 1Q) = ([Q]‘(1Q +pQ 1Q)) |
28 | 21, 25, 27 | 3brtr4i 5096 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 〈cop 4573 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 1oc1o 8095 Ncnpi 10266 +N cpli 10267 ·N cmi 10268 <N clti 10269 +pQ cplpq 10270 <pQ cltpq 10272 Qcnq 10274 1Qc1q 10275 [Q]cerq 10276 +Q cplq 10277 <Q cltq 10280 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-omul 8107 df-er 8289 df-ni 10294 df-pli 10295 df-mi 10296 df-lti 10297 df-plpq 10330 df-ltpq 10332 df-enq 10333 df-nq 10334 df-erq 10335 df-plq 10336 df-1nq 10338 df-ltnq 10340 |
This theorem is referenced by: ltaddnq 10396 |
Copyright terms: Public domain | W3C validator |