Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 1lt2pi | Structured version Visualization version GIF version |
Description: One is less than two (one plus one). (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
1lt2pi | ⊢ 1o <N (1o +N 1o) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1onn 8267 | . . . . 5 ⊢ 1o ∈ ω | |
2 | nna0 8232 | . . . . 5 ⊢ (1o ∈ ω → (1o +o ∅) = 1o) | |
3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (1o +o ∅) = 1o |
4 | 0lt1o 8131 | . . . . 5 ⊢ ∅ ∈ 1o | |
5 | peano1 7603 | . . . . . 6 ⊢ ∅ ∈ ω | |
6 | nnaord 8247 | . . . . . 6 ⊢ ((∅ ∈ ω ∧ 1o ∈ ω ∧ 1o ∈ ω) → (∅ ∈ 1o ↔ (1o +o ∅) ∈ (1o +o 1o))) | |
7 | 5, 1, 1, 6 | mp3an 1457 | . . . . 5 ⊢ (∅ ∈ 1o ↔ (1o +o ∅) ∈ (1o +o 1o)) |
8 | 4, 7 | mpbi 232 | . . . 4 ⊢ (1o +o ∅) ∈ (1o +o 1o) |
9 | 3, 8 | eqeltrri 2912 | . . 3 ⊢ 1o ∈ (1o +o 1o) |
10 | 1pi 10307 | . . . 4 ⊢ 1o ∈ N | |
11 | addpiord 10308 | . . . 4 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) = (1o +o 1o)) | |
12 | 10, 10, 11 | mp2an 690 | . . 3 ⊢ (1o +N 1o) = (1o +o 1o) |
13 | 9, 12 | eleqtrri 2914 | . 2 ⊢ 1o ∈ (1o +N 1o) |
14 | addclpi 10316 | . . . 4 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
15 | 10, 10, 14 | mp2an 690 | . . 3 ⊢ (1o +N 1o) ∈ N |
16 | ltpiord 10311 | . . 3 ⊢ ((1o ∈ N ∧ (1o +N 1o) ∈ N) → (1o <N (1o +N 1o) ↔ 1o ∈ (1o +N 1o))) | |
17 | 10, 15, 16 | mp2an 690 | . 2 ⊢ (1o <N (1o +N 1o) ↔ 1o ∈ (1o +N 1o)) |
18 | 13, 17 | mpbir 233 | 1 ⊢ 1o <N (1o +N 1o) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1537 ∈ wcel 2114 ∅c0 4293 class class class wbr 5068 (class class class)co 7158 ωcom 7582 1oc1o 8097 +o coa 8101 Ncnpi 10268 +N cpli 10269 <N clti 10271 |
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 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-ni 10296 df-pli 10297 df-lti 10299 |
This theorem is referenced by: 1lt2nq 10397 |
Copyright terms: Public domain | W3C validator |