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 8470 | . . . . 5 ⊢ 1o ∈ ω | |
2 | nna0 8435 | . . . . 5 ⊢ (1o ∈ ω → (1o +o ∅) = 1o) | |
3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (1o +o ∅) = 1o |
4 | 0lt1o 8334 | . . . . 5 ⊢ ∅ ∈ 1o | |
5 | peano1 7735 | . . . . . 6 ⊢ ∅ ∈ ω | |
6 | nnaord 8450 | . . . . . 6 ⊢ ((∅ ∈ ω ∧ 1o ∈ ω ∧ 1o ∈ ω) → (∅ ∈ 1o ↔ (1o +o ∅) ∈ (1o +o 1o))) | |
7 | 5, 1, 1, 6 | mp3an 1460 | . . . . 5 ⊢ (∅ ∈ 1o ↔ (1o +o ∅) ∈ (1o +o 1o)) |
8 | 4, 7 | mpbi 229 | . . . 4 ⊢ (1o +o ∅) ∈ (1o +o 1o) |
9 | 3, 8 | eqeltrri 2836 | . . 3 ⊢ 1o ∈ (1o +o 1o) |
10 | 1pi 10639 | . . . 4 ⊢ 1o ∈ N | |
11 | addpiord 10640 | . . . 4 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) = (1o +o 1o)) | |
12 | 10, 10, 11 | mp2an 689 | . . 3 ⊢ (1o +N 1o) = (1o +o 1o) |
13 | 9, 12 | eleqtrri 2838 | . 2 ⊢ 1o ∈ (1o +N 1o) |
14 | addclpi 10648 | . . . 4 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
15 | 10, 10, 14 | mp2an 689 | . . 3 ⊢ (1o +N 1o) ∈ N |
16 | ltpiord 10643 | . . 3 ⊢ ((1o ∈ N ∧ (1o +N 1o) ∈ N) → (1o <N (1o +N 1o) ↔ 1o ∈ (1o +N 1o))) | |
17 | 10, 15, 16 | mp2an 689 | . 2 ⊢ (1o <N (1o +N 1o) ↔ 1o ∈ (1o +N 1o)) |
18 | 13, 17 | mpbir 230 | 1 ⊢ 1o <N (1o +N 1o) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1539 ∈ wcel 2106 ∅c0 4256 class class class wbr 5074 (class class class)co 7275 ωcom 7712 1oc1o 8290 +o coa 8294 Ncnpi 10600 +N cpli 10601 <N clti 10603 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-ni 10628 df-pli 10629 df-lti 10631 |
This theorem is referenced by: 1lt2nq 10729 |
Copyright terms: Public domain | W3C validator |