algcvgblem - Intuitionistic Logic Explorer

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

Theorem algcvgblem 12187

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

**Assertion**
Ref	Expression
algcvgblem	⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) ↔ ((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑀 = 0 → 𝑁 = 0))))

**Proof of Theorem algcvgblem**
Step	Hyp	Ref	Expression
1		nn0z 9337	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
2		0z 9328	. . . . . . . . 9 ⊢ 0 ∈ ℤ
3		zdceq 9392	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑁 = 0)
4	1, 2, 3	sylancl 413	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → DECID 𝑁 = 0)
5	4	dcned 2370	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → DECID 𝑁 ≠ 0)
6		imordc 898	. . . . . . 7 ⊢ (DECID 𝑁 ≠ 0 → ((𝑁 ≠ 0 → 𝑁 < 𝑀) ↔ (¬ 𝑁 ≠ 0 ∨ 𝑁 < 𝑀)))
7	5, 6	syl 14	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → ((𝑁 ≠ 0 → 𝑁 < 𝑀) ↔ (¬ 𝑁 ≠ 0 ∨ 𝑁 < 𝑀)))
8	7	adantl 277	. . . . 5 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) ↔ (¬ 𝑁 ≠ 0 ∨ 𝑁 < 𝑀)))
9		nn0z 9337	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℤ)
10		zltnle 9363	. . . . . . . . . . . . . 14 ⊢ ((0 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (0 < 𝑀 ↔ ¬ 𝑀 ≤ 0))
11	2, 9, 10	sylancr 414	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℕ₀ → (0 < 𝑀 ↔ ¬ 𝑀 ≤ 0))
12	11	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0 < 𝑀 ↔ ¬ 𝑀 ≤ 0))
13		nn0le0eq0 9268	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ₀ → (𝑀 ≤ 0 ↔ 𝑀 = 0))
14	13	notbid 668	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℕ₀ → (¬ 𝑀 ≤ 0 ↔ ¬ 𝑀 = 0))
15	14	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑀 ≤ 0 ↔ ¬ 𝑀 = 0))
16	12, 15	bitrd 188	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0 < 𝑀 ↔ ¬ 𝑀 = 0))
17		df-ne 2365	. . . . . . . . . . 11 ⊢ (𝑀 ≠ 0 ↔ ¬ 𝑀 = 0)
18	16, 17	bitr4di 198	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (0 < 𝑀 ↔ 𝑀 ≠ 0))
19	18	anbi2d 464	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((¬ 𝑁 ≠ 0 ∧ 0 < 𝑀) ↔ (¬ 𝑁 ≠ 0 ∧ 𝑀 ≠ 0)))
20	1	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℤ)
21	20, 2, 3	sylancl 413	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → DECID 𝑁 = 0)
22		nnedc 2369	. . . . . . . . . . . . 13 ⊢ (DECID 𝑁 = 0 → (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0))
23	21, 22	syl 14	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑁 ≠ 0 ↔ 𝑁 = 0))
24		breq1 4032	. . . . . . . . . . . 12 ⊢ (𝑁 = 0 → (𝑁 < 𝑀 ↔ 0 < 𝑀))
25	23, 24	biimtrdi 163	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑁 ≠ 0 → (𝑁 < 𝑀 ↔ 0 < 𝑀)))
26		biimpr 130	. . . . . . . . . . 11 ⊢ ((𝑁 < 𝑀 ↔ 0 < 𝑀) → (0 < 𝑀 → 𝑁 < 𝑀))
27	25, 26	syl6 33	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑁 ≠ 0 → (0 < 𝑀 → 𝑁 < 𝑀)))
28	27	impd 254	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((¬ 𝑁 ≠ 0 ∧ 0 < 𝑀) → 𝑁 < 𝑀))
29	19, 28	sylbird 170	. . . . . . . 8 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((¬ 𝑁 ≠ 0 ∧ 𝑀 ≠ 0) → 𝑁 < 𝑀))
30	29	expd 258	. . . . . . 7 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (¬ 𝑁 ≠ 0 → (𝑀 ≠ 0 → 𝑁 < 𝑀)))
31		ax-1 6	. . . . . . 7 ⊢ (𝑁 < 𝑀 → (𝑀 ≠ 0 → 𝑁 < 𝑀))
32	30, 31	jctir 313	. . . . . 6 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((¬ 𝑁 ≠ 0 → (𝑀 ≠ 0 → 𝑁 < 𝑀)) ∧ (𝑁 < 𝑀 → (𝑀 ≠ 0 → 𝑁 < 𝑀))))
33		jaob 711	. . . . . 6 ⊢ (((¬ 𝑁 ≠ 0 ∨ 𝑁 < 𝑀) → (𝑀 ≠ 0 → 𝑁 < 𝑀)) ↔ ((¬ 𝑁 ≠ 0 → (𝑀 ≠ 0 → 𝑁 < 𝑀)) ∧ (𝑁 < 𝑀 → (𝑀 ≠ 0 → 𝑁 < 𝑀))))
34	32, 33	sylibr 134	. . . . 5 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((¬ 𝑁 ≠ 0 ∨ 𝑁 < 𝑀) → (𝑀 ≠ 0 → 𝑁 < 𝑀)))
35	8, 34	sylbid 150	. . . 4 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) → (𝑀 ≠ 0 → 𝑁 < 𝑀)))
36		nn0ge0 9265	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → 0 ≤ 𝑁)
37	36	adantl 277	. . . . . . 7 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → 0 ≤ 𝑁)
38		nn0re 9249	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℝ)
39		nn0re 9249	. . . . . . . 8 ⊢ (𝑀 ∈ ℕ₀ → 𝑀 ∈ ℝ)
40		0re 8019	. . . . . . . . 9 ⊢ 0 ∈ ℝ
41		lelttr 8108	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((0 ≤ 𝑁 ∧ 𝑁 < 𝑀) → 0 < 𝑀))
42	40, 41	mp3an1 1335	. . . . . . . 8 ⊢ ((𝑁 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((0 ≤ 𝑁 ∧ 𝑁 < 𝑀) → 0 < 𝑀))
43	38, 39, 42	syl2anr 290	. . . . . . 7 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((0 ≤ 𝑁 ∧ 𝑁 < 𝑀) → 0 < 𝑀))
44	37, 43	mpand 429	. . . . . 6 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 < 𝑀 → 0 < 𝑀))
45	44, 18	sylibd 149	. . . . 5 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑁 < 𝑀 → 𝑀 ≠ 0))
46	45	imim2d 54	. . . 4 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) → (𝑁 ≠ 0 → 𝑀 ≠ 0)))
47	35, 46	jcad 307	. . 3 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) → ((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑁 ≠ 0 → 𝑀 ≠ 0))))
48		pm3.34 346	. . 3 ⊢ (((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑁 ≠ 0 → 𝑀 ≠ 0)) → (𝑁 ≠ 0 → 𝑁 < 𝑀))
49	47, 48	impbid1 142	. 2 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) ↔ ((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑁 ≠ 0 → 𝑀 ≠ 0))))
50		con34bdc 872	. . . . 5 ⊢ (DECID 𝑁 = 0 → ((𝑀 = 0 → 𝑁 = 0) ↔ (¬ 𝑁 = 0 → ¬ 𝑀 = 0)))
51	21, 50	syl 14	. . . 4 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑀 = 0 → 𝑁 = 0) ↔ (¬ 𝑁 = 0 → ¬ 𝑀 = 0)))
52		df-ne 2365	. . . . 5 ⊢ (𝑁 ≠ 0 ↔ ¬ 𝑁 = 0)
53	52, 17	imbi12i 239	. . . 4 ⊢ ((𝑁 ≠ 0 → 𝑀 ≠ 0) ↔ (¬ 𝑁 = 0 → ¬ 𝑀 = 0))
54	51, 53	bitr4di 198	. . 3 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑀 = 0 → 𝑁 = 0) ↔ (𝑁 ≠ 0 → 𝑀 ≠ 0)))
55	54	anbi2d 464	. 2 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑀 = 0 → 𝑁 = 0)) ↔ ((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑁 ≠ 0 → 𝑀 ≠ 0))))
56	49, 55	bitr4d 191	1 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → ((𝑁 ≠ 0 → 𝑁 < 𝑀) ↔ ((𝑀 ≠ 0 → 𝑁 < 𝑀) ∧ (𝑀 = 0 → 𝑁 = 0))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 class class class wbr 4029 ℝcr 7871 0cc0 7872 < clt 8054 ≤ cle 8055 ℕ₀cn0 9240 ℤcz 9317

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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988

This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-br 4030 df-opab 4091 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-iota 5215 df-fun 5256 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-inn 8983 df-n0 9241 df-z 9318

This theorem is referenced by: algcvgb 12188

W3C validator