| 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 10942 | . . . 4 ⊢ (𝐴 ∈ N ↔ (𝐴 ∈ ω ∧ 𝐴 ≠ ∅)) | |
| 2 | 1 | simprbi 503 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ≠ ∅) |
| 3 | noel 4284 | . . . . . 6 ⊢ ¬ 𝐴 ∈ ∅ | |
| 4 | 1pi 10949 | . . . . . . . . . 10 ⊢ 1o ∈ N | |
| 5 | ltpiord 10953 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ N ∧ 1o ∈ N) → (𝐴 <N 1o ↔ 𝐴 ∈ 1o)) | |
| 6 | 4, 5 | mpan2 704 | . . . . . . . . 9 ⊢ (𝐴 ∈ N → (𝐴 <N 1o ↔ 𝐴 ∈ 1o)) |
| 7 | df-1o 8460 | . . . . . . . . . . 11 ⊢ 1o = suc ∅ | |
| 8 | 7 | eleq2i 2853 | . . . . . . . . . 10 ⊢ (𝐴 ∈ 1o ↔ 𝐴 ∈ suc ∅) |
| 9 | elsucg 6426 | . . . . . . . . . 10 ⊢ (𝐴 ∈ N → (𝐴 ∈ suc ∅ ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) | |
| 10 | 8, 9 | bitrid 286 | . . . . . . . . 9 ⊢ (𝐴 ∈ N → (𝐴 ∈ 1o ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) |
| 11 | 6, 10 | bitrd 282 | . . . . . . . 8 ⊢ (𝐴 ∈ N → (𝐴 <N 1o ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) |
| 12 | 11 | biimpa 482 | . . . . . . 7 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → (𝐴 ∈ ∅ ∨ 𝐴 = ∅)) |
| 13 | 12 | ord 878 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → (¬ 𝐴 ∈ ∅ → 𝐴 = ∅)) |
| 14 | 3, 13 | mpi 21 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → 𝐴 = ∅) |
| 15 | 14 | ex 418 | . . . 4 ⊢ (𝐴 ∈ N → (𝐴 <N 1o → 𝐴 = ∅)) |
| 16 | 15 | necon3ad 2969 | . . 3 ⊢ (𝐴 ∈ N → (𝐴 ≠ ∅ → ¬ 𝐴 <N 1o)) |
| 17 | 2, 16 | mpd 16 | . 2 ⊢ (𝐴 ∈ N → ¬ 𝐴 <N 1o) |
| 18 | ltrelpi 10955 | . . . . 5 ⊢ <N ⊆ (N × N) | |
| 19 | 18 | brel 5716 | . . . 4 ⊢ (𝐴 <N 1o → (𝐴 ∈ N ∧ 1o ∈ N)) |
| 20 | 19 | simpld 500 | . . 3 ⊢ (𝐴 <N 1o → 𝐴 ∈ N) |
| 21 | 20 | con3i 155 | . 2 ⊢ (¬ 𝐴 ∈ N → ¬ 𝐴 <N 1o) |
| 22 | 17, 21 | pm2.61i 184 | 1 ⊢ ¬ 𝐴 <N 1o |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∅c0 4279 class class class wbr 5103 suc csuc 6357 ωcom 7866 1oc1o 8453 Ncnpi 10910 <N clti 10913 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-om 7867 df-1o 8460 df-ni 10938 df-lti 10941 |
| This theorem is used by: indpi 10973 pinq 10993 archnq 11046 |
| Copyright terms: Public domain | W3C validator |