![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nlt1pi | Structured version Visualization version GIF version |
Description: No positive integer is less than one. (Contributed by NM, 23-Mar-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nlt1pi | ⊢ ¬ 𝐴 <N 1o |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elni 10945 | . . . 4 ⊢ (𝐴 ∈ N ↔ (𝐴 ∈ ω ∧ 𝐴 ≠ ∅)) | |
2 | 1 | simprbi 496 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ≠ ∅) |
3 | noel 4360 | . . . . . 6 ⊢ ¬ 𝐴 ∈ ∅ | |
4 | 1pi 10952 | . . . . . . . . . 10 ⊢ 1o ∈ N | |
5 | ltpiord 10956 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ N ∧ 1o ∈ N) → (𝐴 <N 1o ↔ 𝐴 ∈ 1o)) | |
6 | 4, 5 | mpan2 690 | . . . . . . . . 9 ⊢ (𝐴 ∈ N → (𝐴 <N 1o ↔ 𝐴 ∈ 1o)) |
7 | df-1o 8522 | . . . . . . . . . . 11 ⊢ 1o = suc ∅ | |
8 | 7 | eleq2i 2836 | . . . . . . . . . 10 ⊢ (𝐴 ∈ 1o ↔ 𝐴 ∈ suc ∅) |
9 | elsucg 6463 | . . . . . . . . . 10 ⊢ (𝐴 ∈ N → (𝐴 ∈ suc ∅ ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) | |
10 | 8, 9 | bitrid 283 | . . . . . . . . 9 ⊢ (𝐴 ∈ N → (𝐴 ∈ 1o ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) |
11 | 6, 10 | bitrd 279 | . . . . . . . 8 ⊢ (𝐴 ∈ N → (𝐴 <N 1o ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) |
12 | 11 | biimpa 476 | . . . . . . 7 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → (𝐴 ∈ ∅ ∨ 𝐴 = ∅)) |
13 | 12 | ord 863 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → (¬ 𝐴 ∈ ∅ → 𝐴 = ∅)) |
14 | 3, 13 | mpi 20 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → 𝐴 = ∅) |
15 | 14 | ex 412 | . . . 4 ⊢ (𝐴 ∈ N → (𝐴 <N 1o → 𝐴 = ∅)) |
16 | 15 | necon3ad 2959 | . . 3 ⊢ (𝐴 ∈ N → (𝐴 ≠ ∅ → ¬ 𝐴 <N 1o)) |
17 | 2, 16 | mpd 15 | . 2 ⊢ (𝐴 ∈ N → ¬ 𝐴 <N 1o) |
18 | ltrelpi 10958 | . . . . 5 ⊢ <N ⊆ (N × N) | |
19 | 18 | brel 5765 | . . . 4 ⊢ (𝐴 <N 1o → (𝐴 ∈ N ∧ 1o ∈ N)) |
20 | 19 | simpld 494 | . . 3 ⊢ (𝐴 <N 1o → 𝐴 ∈ N) |
21 | 20 | con3i 154 | . 2 ⊢ (¬ 𝐴 ∈ N → ¬ 𝐴 <N 1o) |
22 | 17, 21 | pm2.61i 182 | 1 ⊢ ¬ 𝐴 <N 1o |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 206 ∧ wa 395 ∨ wo 846 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∅c0 4352 class class class wbr 5166 suc csuc 6397 ωcom 7903 1oc1o 8515 Ncnpi 10913 <N clti 10916 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-tr 5284 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-om 7904 df-1o 8522 df-ni 10941 df-lti 10944 |
This theorem is referenced by: indpi 10976 pinq 10996 archnq 11049 |
Copyright terms: Public domain | W3C validator |