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 8541 | . . . . 5 ⊢ 1o ∈ ω | |
2 | nna0 8506 | . . . . 5 ⊢ (1o ∈ ω → (1o +o ∅) = 1o) | |
3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (1o +o ∅) = 1o |
4 | 0lt1o 8405 | . . . . 5 ⊢ ∅ ∈ 1o | |
5 | peano1 7803 | . . . . . 6 ⊢ ∅ ∈ ω | |
6 | nnaord 8521 | . . . . . 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 2834 | . . 3 ⊢ 1o ∈ (1o +o 1o) |
10 | 1pi 10740 | . . . 4 ⊢ 1o ∈ N | |
11 | addpiord 10741 | . . . 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 2836 | . 2 ⊢ 1o ∈ (1o +N 1o) |
14 | addclpi 10749 | . . . 4 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o +N 1o) ∈ N) | |
15 | 10, 10, 14 | mp2an 689 | . . 3 ⊢ (1o +N 1o) ∈ N |
16 | ltpiord 10744 | . . 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 1540 ∈ wcel 2105 ∅c0 4269 class class class wbr 5092 (class class class)co 7337 ωcom 7780 1oc1o 8360 +o coa 8364 Ncnpi 10701 +N cpli 10702 <N clti 10704 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5243 ax-nul 5250 ax-pr 5372 ax-un 7650 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4270 df-if 4474 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5176 df-tr 5210 df-id 5518 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5575 df-we 5577 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6238 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6431 df-fun 6481 df-fn 6482 df-f 6483 df-f1 6484 df-fo 6485 df-f1o 6486 df-fv 6487 df-ov 7340 df-oprab 7341 df-mpo 7342 df-om 7781 df-2nd 7900 df-frecs 8167 df-wrecs 8198 df-recs 8272 df-rdg 8311 df-1o 8367 df-oadd 8371 df-ni 10729 df-pli 10730 df-lti 10732 |
This theorem is referenced by: 1lt2nq 10830 |
Copyright terms: Public domain | W3C validator |