Theorem algcvgblem 12829

Description: Lemma for algcvgb 12830. (Contributed by Paul Chapman, 31-Mar-2011.)

Assertion

Ref	Expression
algcvgblem	|- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) <-> ( ( M =/= 0 -> N < M ) /\ ( M = 0 -> N = 0 ) ) ) )

Proof of Theorem algcvgblem

Step	Hyp	Ref	Expression
1		nn0z 9666	. . . . . . . . 9 |- ( N e. NN0 -> N e. ZZ )
2		0z 9657	. . . . . . . . 9 |- 0 e. ZZ
3		zdceq 9722	. . . . . . . . 9 |- ( ( N e. ZZ /\ 0 e. ZZ ) -> DECID N = 0 )
4	1, 2, 3	sylancl 417	. . . . . . . 8 |- ( N e. NN0 -> DECID N = 0 )
5	4	dcned 2426	. . . . . . 7 |- ( N e. NN0 -> DECID N =/= 0 )
6		imordc 909	. . . . . . 7 |- (DECID N =/= 0 -> ( ( N =/= 0 -> N < M ) <-> ( -. N =/= 0 \/ N < M ) ) )
7	5, 6	syl 14	. . . . . 6 |- ( N e. NN0 -> ( ( N =/= 0 -> N < M ) <-> ( -. N =/= 0 \/ N < M ) ) )
8	7	adantl 277	. . . . 5 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) <-> ( -. N =/= 0 \/ N < M ) ) )
9		nn0z 9666	. . . . . . . . . . . . . 14 |- ( M e. NN0 -> M e. ZZ )
10		zltnle 9692	. . . . . . . . . . . . . 14 |- ( ( 0 e. ZZ /\ M e. ZZ ) -> ( 0 < M <-> -. M <_ 0 ) )
11	2, 9, 10	sylancr 418	. . . . . . . . . . . . 13 |- ( M e. NN0 -> ( 0 < M <-> -. M <_ 0 ) )
12	11	adantr 276	. . . . . . . . . . . 12 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( 0 < M <-> -. M <_ 0 ) )
13		nn0le0eq0 9593	. . . . . . . . . . . . . 14 |- ( M e. NN0 -> ( M <_ 0 <-> M = 0 ) )
14	13	notbid 677	. . . . . . . . . . . . 13 |- ( M e. NN0 -> ( -. M <_ 0 <-> -. M = 0 ) )
15	14	adantr 276	. . . . . . . . . . . 12 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( -. M <_ 0 <-> -. M = 0 ) )
16	12, 15	bitrd 188	. . . . . . . . . . 11 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( 0 < M <-> -. M = 0 ) )
17		df-ne 2421	. . . . . . . . . . 11 |- ( M =/= 0 <-> -. M = 0 )
18	16, 17	bitr4di 198	. . . . . . . . . 10 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( 0 < M <-> M =/= 0 ) )
19	18	anbi2d 468	. . . . . . . . 9 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( -. N =/= 0 /\ 0 < M ) <-> ( -. N =/= 0 /\ M =/= 0 ) ) )
20	1	adantl 277	. . . . . . . . . . . . . 14 |- ( ( M e. NN0 /\ N e. NN0 ) -> N e. ZZ )
21	20, 2, 3	sylancl 417	. . . . . . . . . . . . 13 |- ( ( M e. NN0 /\ N e. NN0 ) -> DECID N = 0 )
22		nnedc 2425	. . . . . . . . . . . . 13 |- (DECID N = 0 -> ( -. N =/= 0 <-> N = 0 ) )
23	21, 22	syl 14	. . . . . . . . . . . 12 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( -. N =/= 0 <-> N = 0 ) )
24		breq1 4133	. . . . . . . . . . . 12 |- ( N = 0 -> ( N < M <-> 0 < M ) )
25	23, 24	biimtrdi 163	. . . . . . . . . . 11 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( -. N =/= 0 -> ( N < M <-> 0 < M ) ) )
26		biimpr 130	. . . . . . . . . . 11 |- ( ( N < M <-> 0 < M ) -> ( 0 < M -> N < M ) )
27	25, 26	syl6 33	. . . . . . . . . 10 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( -. N =/= 0 -> ( 0 < M -> N < M ) ) )
28	27	impd 254	. . . . . . . . 9 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( -. N =/= 0 /\ 0 < M ) -> N < M ) )
29	19, 28	sylbird 170	. . . . . . . 8 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( -. N =/= 0 /\ M =/= 0 ) -> N < M ) )
30	29	expd 258	. . . . . . 7 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( -. N =/= 0 -> ( M =/= 0 -> N < M ) ) )
31		ax-1 6	. . . . . . 7 |- ( N < M -> ( M =/= 0 -> N < M ) )
32	30, 31	jctir 313	. . . . . 6 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( -. N =/= 0 -> ( M =/= 0 -> N < M ) ) /\ ( N < M -> ( M =/= 0 -> N < M ) ) ) )
33		jaob 722	. . . . . 6 |- ( ( ( -. N =/= 0 \/ N < M ) -> ( M =/= 0 -> N < M ) ) <-> ( ( -. N =/= 0 -> ( M =/= 0 -> N < M ) ) /\ ( N < M -> ( M =/= 0 -> N < M ) ) ) )
34	32, 33	sylibr 134	. . . . 5 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( -. N =/= 0 \/ N < M ) -> ( M =/= 0 -> N < M ) ) )
35	8, 34	sylbid 150	. . . 4 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) -> ( M =/= 0 -> N < M ) ) )
36		nn0ge0 9590	. . . . . . . 8 |- ( N e. NN0 -> 0 <_ N )
37	36	adantl 277	. . . . . . 7 |- ( ( M e. NN0 /\ N e. NN0 ) -> 0 <_ N )
38		nn0re 9574	. . . . . . . 8 |- ( N e. NN0 -> N e. RR )
39		nn0re 9574	. . . . . . . 8 |- ( M e. NN0 -> M e. RR )
40		0re 8326	. . . . . . . . 9 |- 0 e. RR
41		lelttr 8414	. . . . . . . . 9 |- ( ( 0 e. RR /\ N e. RR /\ M e. RR ) -> ( ( 0 <_ N /\ N < M ) -> 0 < M ) )
42	40, 41	mp3an1 1365	. . . . . . . 8 |- ( ( N e. RR /\ M e. RR ) -> ( ( 0 <_ N /\ N < M ) -> 0 < M ) )
43	38, 39, 42	syl2anr 290	. . . . . . 7 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( 0 <_ N /\ N < M ) -> 0 < M ) )
44	37, 43	mpand 433	. . . . . 6 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( N < M -> 0 < M ) )
45	44, 18	sylibd 149	. . . . 5 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( N < M -> M =/= 0 ) )
46	45	imim2d 54	. . . 4 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) -> ( N =/= 0 -> M =/= 0 ) ) )
47	35, 46	jcad 307	. . 3 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) -> ( ( M =/= 0 -> N < M ) /\ ( N =/= 0 -> M =/= 0 ) ) ) )
48		pm3.34 346	. . 3 |- ( ( ( M =/= 0 -> N < M ) /\ ( N =/= 0 -> M =/= 0 ) ) -> ( N =/= 0 -> N < M ) )
49	47, 48	impbid1 142	. 2 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) <-> ( ( M =/= 0 -> N < M ) /\ ( N =/= 0 -> M =/= 0 ) ) ) )
50		con34bdc 883	. . . . 5 |- (DECID N = 0 -> ( ( M = 0 -> N = 0 ) <-> ( -. N = 0 -> -. M = 0 ) ) )
51	21, 50	syl 14	. . . 4 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( M = 0 -> N = 0 ) <-> ( -. N = 0 -> -. M = 0 ) ) )
52		df-ne 2421	. . . . 5 |- ( N =/= 0 <-> -. N = 0 )
53	52, 17	imbi12i 239	. . . 4 |- ( ( N =/= 0 -> M =/= 0 ) <-> ( -. N = 0 -> -. M = 0 ) )
54	51, 53	bitr4di 198	. . 3 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( M = 0 -> N = 0 ) <-> ( N =/= 0 -> M =/= 0 ) ) )
55	54	anbi2d 468	. 2 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( ( M =/= 0 -> N < M ) /\ ( M = 0 -> N = 0 ) ) <-> ( ( M =/= 0 -> N < M ) /\ ( N =/= 0 -> M =/= 0 ) ) ) )
56	49, 55	bitr4d 191	1 |- ( ( M e. NN0 /\ N e. NN0 ) -> ( ( N =/= 0 -> N < M ) <-> ( ( M =/= 0 -> N < M ) /\ ( M = 0 -> N = 0 ) ) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   =/= wne 2420   class class class wbr 4130   RRcr 8178   0cc0 8179   < clt 8360   <_ cle 8361   NN0cn0 9565   ZZcz 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-stab 843  df-dc 847  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-n0 9566  df-z 9647

This theorem is used by:  algcvgb  12830