![]() |
Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sn-0ne2 | Structured version Visualization version GIF version |
Description: 0ne2 12500 without ax-mulcom 11248. (Contributed by SN, 23-Jan-2024.) |
Ref | Expression |
---|---|
sn-0ne2 | ⊢ 0 ≠ 2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1re 11290 | . . . 4 ⊢ 1 ∈ ℝ | |
2 | readdlid 42379 | . . . 4 ⊢ (1 ∈ ℝ → (0 + 1) = 1) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (0 + 1) = 1 |
4 | sn-1ne2 42254 | . . . . . 6 ⊢ 1 ≠ 2 | |
5 | 2re 12367 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
6 | 1, 5 | lttri2i 11404 | . . . . . 6 ⊢ (1 ≠ 2 ↔ (1 < 2 ∨ 2 < 1)) |
7 | 4, 6 | mpbi 230 | . . . . 5 ⊢ (1 < 2 ∨ 2 < 1) |
8 | 1red 11291 | . . . . . . 7 ⊢ (1 < 2 → 1 ∈ ℝ) | |
9 | 1, 5, 1 | ltadd2i 11421 | . . . . . . . . . 10 ⊢ (1 < 2 ↔ (1 + 1) < (1 + 2)) |
10 | 9 | biimpi 216 | . . . . . . . . 9 ⊢ (1 < 2 → (1 + 1) < (1 + 2)) |
11 | 1p1e2 12418 | . . . . . . . . 9 ⊢ (1 + 1) = 2 | |
12 | 1p2e3 12436 | . . . . . . . . 9 ⊢ (1 + 2) = 3 | |
13 | 10, 11, 12 | 3brtr3g 5199 | . . . . . . . 8 ⊢ (1 < 2 → 2 < 3) |
14 | 3re 12373 | . . . . . . . . 9 ⊢ 3 ∈ ℝ | |
15 | 1, 5, 14 | lttri 11416 | . . . . . . . 8 ⊢ ((1 < 2 ∧ 2 < 3) → 1 < 3) |
16 | 13, 15 | mpdan 686 | . . . . . . 7 ⊢ (1 < 2 → 1 < 3) |
17 | 8, 16 | ltned 11426 | . . . . . 6 ⊢ (1 < 2 → 1 ≠ 3) |
18 | 14 | a1i 11 | . . . . . . 7 ⊢ (2 < 1 → 3 ∈ ℝ) |
19 | 5, 1, 1 | ltadd2i 11421 | . . . . . . . . . 10 ⊢ (2 < 1 ↔ (1 + 2) < (1 + 1)) |
20 | 19 | biimpi 216 | . . . . . . . . 9 ⊢ (2 < 1 → (1 + 2) < (1 + 1)) |
21 | 20, 12, 11 | 3brtr3g 5199 | . . . . . . . 8 ⊢ (2 < 1 → 3 < 2) |
22 | 14, 5, 1 | lttri 11416 | . . . . . . . 8 ⊢ ((3 < 2 ∧ 2 < 1) → 3 < 1) |
23 | 21, 22 | mpancom 687 | . . . . . . 7 ⊢ (2 < 1 → 3 < 1) |
24 | 18, 23 | gtned 11425 | . . . . . 6 ⊢ (2 < 1 → 1 ≠ 3) |
25 | 17, 24 | jaoi 856 | . . . . 5 ⊢ ((1 < 2 ∨ 2 < 1) → 1 ≠ 3) |
26 | 7, 25 | ax-mp 5 | . . . 4 ⊢ 1 ≠ 3 |
27 | df-3 12357 | . . . 4 ⊢ 3 = (2 + 1) | |
28 | 26, 27 | neeqtri 3019 | . . 3 ⊢ 1 ≠ (2 + 1) |
29 | 3, 28 | eqnetri 3017 | . 2 ⊢ (0 + 1) ≠ (2 + 1) |
30 | oveq1 7455 | . . 3 ⊢ (0 = 2 → (0 + 1) = (2 + 1)) | |
31 | 30 | necon3i 2979 | . 2 ⊢ ((0 + 1) ≠ (2 + 1) → 0 ≠ 2) |
32 | 29, 31 | ax-mp 5 | 1 ⊢ 0 ≠ 2 |
Colors of variables: wff setvar class |
Syntax hints: ∨ wo 846 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 class class class wbr 5166 (class class class)co 7448 ℝcr 11183 0cc0 11184 1c1 11185 + caddc 11187 < clt 11324 2c2 12348 3c3 12349 |
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-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 |
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-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 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-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-ltxr 11329 df-2 12356 df-3 12357 df-resub 42342 |
This theorem is referenced by: remul01 42383 sn-0tie0 42415 |
Copyright terms: Public domain | W3C validator |