Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nlt1pig | GIF version |
Description: No positive integer is less than one. (Contributed by Jim Kingdon, 31-Aug-2019.) |
Ref | Expression |
---|---|
nlt1pig | ⊢ (𝐴 ∈ N → ¬ 𝐴 <N 1o) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elni 7282 | . . 3 ⊢ (𝐴 ∈ N ↔ (𝐴 ∈ ω ∧ 𝐴 ≠ ∅)) | |
2 | 1 | simprbi 275 | . 2 ⊢ (𝐴 ∈ N → 𝐴 ≠ ∅) |
3 | noel 3424 | . . . . 5 ⊢ ¬ 𝐴 ∈ ∅ | |
4 | 1pi 7289 | . . . . . . . . 9 ⊢ 1o ∈ N | |
5 | ltpiord 7293 | . . . . . . . . 9 ⊢ ((𝐴 ∈ N ∧ 1o ∈ N) → (𝐴 <N 1o ↔ 𝐴 ∈ 1o)) | |
6 | 4, 5 | mpan2 425 | . . . . . . . 8 ⊢ (𝐴 ∈ N → (𝐴 <N 1o ↔ 𝐴 ∈ 1o)) |
7 | df-1o 6407 | . . . . . . . . . 10 ⊢ 1o = suc ∅ | |
8 | 7 | eleq2i 2242 | . . . . . . . . 9 ⊢ (𝐴 ∈ 1o ↔ 𝐴 ∈ suc ∅) |
9 | elsucg 4398 | . . . . . . . . 9 ⊢ (𝐴 ∈ N → (𝐴 ∈ suc ∅ ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) | |
10 | 8, 9 | bitrid 192 | . . . . . . . 8 ⊢ (𝐴 ∈ N → (𝐴 ∈ 1o ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) |
11 | 6, 10 | bitrd 188 | . . . . . . 7 ⊢ (𝐴 ∈ N → (𝐴 <N 1o ↔ (𝐴 ∈ ∅ ∨ 𝐴 = ∅))) |
12 | 11 | biimpa 296 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → (𝐴 ∈ ∅ ∨ 𝐴 = ∅)) |
13 | 12 | ord 724 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → (¬ 𝐴 ∈ ∅ → 𝐴 = ∅)) |
14 | 3, 13 | mpi 15 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐴 <N 1o) → 𝐴 = ∅) |
15 | 14 | ex 115 | . . 3 ⊢ (𝐴 ∈ N → (𝐴 <N 1o → 𝐴 = ∅)) |
16 | 15 | necon3ad 2387 | . 2 ⊢ (𝐴 ∈ N → (𝐴 ≠ ∅ → ¬ 𝐴 <N 1o)) |
17 | 2, 16 | mpd 13 | 1 ⊢ (𝐴 ∈ N → ¬ 𝐴 <N 1o) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 = wceq 1353 ∈ wcel 2146 ≠ wne 2345 ∅c0 3420 class class class wbr 3998 suc csuc 4359 ωcom 4583 1oc1o 6400 Ncnpi 7246 <N clti 7249 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-13 2148 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-nul 4124 ax-pow 4169 ax-pr 4203 ax-un 4427 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1459 df-sb 1761 df-eu 2027 df-mo 2028 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ne 2346 df-ral 2458 df-rex 2459 df-v 2737 df-dif 3129 df-un 3131 df-in 3133 df-ss 3140 df-nul 3421 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-uni 3806 df-int 3841 df-br 3999 df-opab 4060 df-eprel 4283 df-suc 4365 df-iom 4584 df-xp 4626 df-1o 6407 df-ni 7278 df-lti 7281 |
This theorem is referenced by: caucvgsr 7776 |
Copyright terms: Public domain | W3C validator |