![]() |
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 10840 | . . . . . 6 ⊢ 1o <N (1o +N 1o) | |
2 | 1pi 10818 | . . . . . . 7 ⊢ 1o ∈ N | |
3 | mulidpi 10821 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
5 | addclpi 10827 | . . . . . . . 8 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
6 | 2, 2, 5 | mp2an 690 | . . . . . . 7 ⊢ (1o +N 1o) ∈ N |
7 | mulidpi 10821 | . . . . . . 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 10877 | . . . . 5 ⊢ (〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 ↔ (1o ·N 1o) <N ((1o +N 1o) ·N 1o)) | |
11 | 9, 10 | mpbir 230 | . . . 4 ⊢ 〈1o, 1o〉 <pQ 〈(1o +N 1o), 1o〉 |
12 | df-1nq 10851 | . . . 4 ⊢ 1Q = 〈1o, 1o〉 | |
13 | 12, 12 | oveq12i 7368 | . . . . 5 ⊢ (1Q +pQ 1Q) = (〈1o, 1o〉 +pQ 〈1o, 1o〉) |
14 | addpipq 10872 | . . . . . 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 7368 | . . . . . 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 2768 | . . . 4 ⊢ (1Q +pQ 1Q) = 〈(1o +N 1o), 1o〉 |
19 | 11, 12, 18 | 3brtr4i 5135 | . . 3 ⊢ 1Q <pQ (1Q +pQ 1Q) |
20 | lterpq 10905 | . . 3 ⊢ (1Q <pQ (1Q +pQ 1Q) ↔ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q))) | |
21 | 19, 20 | mpbi 229 | . 2 ⊢ ([Q]‘1Q) <Q ([Q]‘(1Q +pQ 1Q)) |
22 | 1nq 10863 | . . . 4 ⊢ 1Q ∈ Q | |
23 | nqerid 10868 | . . . 4 ⊢ (1Q ∈ Q → ([Q]‘1Q) = 1Q) | |
24 | 22, 23 | ax-mp 5 | . . 3 ⊢ ([Q]‘1Q) = 1Q |
25 | 24 | eqcomi 2745 | . 2 ⊢ 1Q = ([Q]‘1Q) |
26 | addpqnq 10873 | . . 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 5135 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∈ wcel 2106 〈cop 4592 class class class wbr 5105 ‘cfv 6496 (class class class)co 7356 1oc1o 8404 Ncnpi 10779 +N cpli 10780 ·N cmi 10781 <N clti 10782 +pQ cplpq 10783 <pQ cltpq 10785 Qcnq 10787 1Qc1q 10788 [Q]cerq 10789 +Q cplq 10790 <Q cltq 10793 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pr 5384 ax-un 7671 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7802 df-1st 7920 df-2nd 7921 df-frecs 8211 df-wrecs 8242 df-recs 8316 df-rdg 8355 df-1o 8411 df-oadd 8415 df-omul 8416 df-er 8647 df-ni 10807 df-pli 10808 df-mi 10809 df-lti 10810 df-plpq 10843 df-ltpq 10845 df-enq 10846 df-nq 10847 df-erq 10848 df-plq 10849 df-1nq 10851 df-ltnq 10853 |
This theorem is referenced by: ltaddnq 10909 |
Copyright terms: Public domain | W3C validator |