nn0le2is012 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > nn0le2is012		Unicode version

Theorem nn0le2is012 9730

Description: A nonnegative integer which is less than or equal to 2 is either 0 or 1 or 2. (Contributed by AV, 16-Mar-2019.)

**Assertion**
Ref	Expression
nn0le2is012	$/\$ $\/$ $\/$

**Proof of Theorem nn0le2is012**
Step	Hyp	Ref	Expression
1		nn0z 9666	. . . 4
2		2z 9674	. . . 4
3		zleloe 9693	. . . 4 $/\$ $\/$
4	1, 2, 3	sylancl 417	. . 3 $\/$
5		zltlem1 9704	. . . . . . . . 9 $/\$
6	1, 2, 5	sylancl 417	. . . . . . . 8
7		2m1e1 9423	. . . . . . . . . 10
8	7	a1i 9	. . . . . . . . 9
9	8	breq2d 4142	. . . . . . . 8
10	6, 9	bitrd 188	. . . . . . 7
11		1z 9672	. . . . . . . . 9
12		zleloe 9693	. . . . . . . . 9 $/\$ $\/$
13	1, 11, 12	sylancl 417	. . . . . . . 8 $\/$
14		nn0lt10b 9728	. . . . . . . . . . . 12
15		3mix1 1197	. . . . . . . . . . . 12 $\/$ $\/$
16	14, 15	biimtrdi 163	. . . . . . . . . . 11 $\/$ $\/$
17	16	com12 30	. . . . . . . . . 10 $\/$ $\/$
18		3mix2 1198	. . . . . . . . . . 11 $\/$ $\/$
19	18	a1d 22	. . . . . . . . . 10 $\/$ $\/$
20	17, 19	jaoi 728	. . . . . . . . 9 $\/$ $\/$ $\/$
21	20	com12 30	. . . . . . . 8 $\/$ $\/$ $\/$
22	13, 21	sylbid 150	. . . . . . 7 $\/$ $\/$
23	10, 22	sylbid 150	. . . . . 6 $\/$ $\/$
24	23	com12 30	. . . . 5 $\/$ $\/$
25		3mix3 1199	. . . . . 6 $\/$ $\/$
26	25	a1d 22	. . . . 5 $\/$ $\/$
27	24, 26	jaoi 728	. . . 4 $\/$ $\/$ $\/$
28	27	com12 30	. . 3 $\/$ $\/$ $\/$
29	4, 28	sylbid 150	. 2 $\/$ $\/$
30	29	imp 124	1 $/\$ $\/$ $\/$

Colors of variables: wff set class

This proof depends on syntax axioms:

wi 4 $/\$ wa 104

wb 105 $\/$ wo 720 $\/$ w3o 1008

wceq 1402

wcel 2209 class class class wbr 4130 (class class class)co 6085

cc0 8179

c1 8180

clt 8360

cle 8361

cmin 8497

c2 9356

cn0 9565

cz 9646

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295

This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9306 df-2 9364 df-n0 9566 df-z 9647

This theorem is used by: xnn0le2is012 10270