Theorem fnn0ind 9640

Description: Induction on the integers from 0 to 𝑁 inclusive . The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. (Contributed by Paul Chapman, 31-Mar-2011.)

Hypotheses

Ref	Expression
fnn0ind.1	⊢ (𝑥 = 0 → (𝜑 ↔ 𝜓))
fnn0ind.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
fnn0ind.3	⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃))
fnn0ind.4	⊢ (𝑥 = 𝐾 → (𝜑 ↔ 𝜏))
fnn0ind.5	⊢ (𝑁 ∈ ℕ0 → 𝜓)
fnn0ind.6	⊢ ((𝑁 ∈ ℕ0 ∧ 𝑦 ∈ ℕ0 ∧ 𝑦 < 𝑁) → (𝜒 → 𝜃))

Assertion

Ref	Expression
fnn0ind	⊢ ((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁) → 𝜏)

Distinct variable groups:   𝑥,𝐾   𝑥,𝑁,𝑦   𝜒,𝑥   𝜑,𝑦   𝜓,𝑥   𝜏,𝑥   𝜃,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)   𝜏(𝑦)   𝐾(𝑦)

Proof of Theorem fnn0ind

Step	Hyp	Ref	Expression
1		elnn0z 9536	. . . 4 ⊢ (𝐾 ∈ ℕ0 ↔ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾))
2		nn0z 9543	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ)
3		0z 9534	. . . . . . . 8 ⊢ 0 ∈ ℤ
4		fnn0ind.1	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝜑 ↔ 𝜓))
5		fnn0ind.2	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
6		fnn0ind.3	. . . . . . . . 9 ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃))
7		fnn0ind.4	. . . . . . . . 9 ⊢ (𝑥 = 𝐾 → (𝜑 ↔ 𝜏))
8		elnn0z 9536	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℤ ∧ 0 ≤ 𝑁))
9		fnn0ind.5	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → 𝜓)
10	8, 9	sylbir 135	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ 0 ≤ 𝑁) → 𝜓)
11	10	3adant1 1042	. . . . . . . . 9 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 0 ≤ 𝑁) → 𝜓)
12		zre 9527	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℝ)
13		zre 9527	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ)
14		0re 8222	. . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ ℝ
15		lelttr 8310	. . . . . . . . . . . . . . . . . 18 ⊢ ((0 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → 0 < 𝑁))
16		ltle 8309	. . . . . . . . . . . . . . . . . . 19 ⊢ ((0 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (0 < 𝑁 → 0 ≤ 𝑁))
17	16	3adant2 1043	. . . . . . . . . . . . . . . . . 18 ⊢ ((0 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (0 < 𝑁 → 0 ≤ 𝑁))
18	15, 17	syld 45	. . . . . . . . . . . . . . . . 17 ⊢ ((0 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → 0 ≤ 𝑁))
19	14, 18	mp3an1 1361	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → 0 ≤ 𝑁))
20	12, 13, 19	syl2an 289	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → 0 ≤ 𝑁))
21	20	ex 115	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℤ → (𝑁 ∈ ℤ → ((0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → 0 ≤ 𝑁)))
22	21	com23 78	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℤ → ((0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → (𝑁 ∈ ℤ → 0 ≤ 𝑁)))
23	22	3impib 1228	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → (𝑁 ∈ ℤ → 0 ≤ 𝑁))
24	23	impcom 125	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁)) → 0 ≤ 𝑁)
25		elnn0z 9536	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ℕ0 ↔ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦))
26	25	anbi1i 458	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝑦 < 𝑁) ↔ ((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦) ∧ 𝑦 < 𝑁))
27		fnn0ind.6	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑦 ∈ ℕ0 ∧ 𝑦 < 𝑁) → (𝜒 → 𝜃))
28	27	3expb 1231	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑦 ∈ ℕ0 ∧ 𝑦 < 𝑁)) → (𝜒 → 𝜃))
29	8, 26, 28	syl2anbr 292	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℤ ∧ 0 ≤ 𝑁) ∧ ((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦) ∧ 𝑦 < 𝑁)) → (𝜒 → 𝜃))
30	29	expcom 116	. . . . . . . . . . . . . 14 ⊢ (((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦) ∧ 𝑦 < 𝑁) → ((𝑁 ∈ ℤ ∧ 0 ≤ 𝑁) → (𝜒 → 𝜃)))
31	30	3impa 1221	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → ((𝑁 ∈ ℤ ∧ 0 ≤ 𝑁) → (𝜒 → 𝜃)))
32	31	expd 258	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁) → (𝑁 ∈ ℤ → (0 ≤ 𝑁 → (𝜒 → 𝜃))))
33	32	impcom 125	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁)) → (0 ≤ 𝑁 → (𝜒 → 𝜃)))
34	24, 33	mpd 13	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁)) → (𝜒 → 𝜃))
35	34	adantll 476	. . . . . . . . 9 ⊢ (((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦 ∧ 𝑦 < 𝑁)) → (𝜒 → 𝜃))
36	4, 5, 6, 7, 11, 35	fzind 9639	. . . . . . . 8 ⊢ (((0 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) → 𝜏)
37	3, 36	mpanl1 434	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ (𝐾 ∈ ℤ ∧ 0 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁)) → 𝜏)
38	37	expcom 116	. . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 0 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → (𝑁 ∈ ℤ → 𝜏))
39	2, 38	syl5 32	. . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ 0 ≤ 𝐾 ∧ 𝐾 ≤ 𝑁) → (𝑁 ∈ ℕ0 → 𝜏))
40	39	3expa 1230	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 0 ≤ 𝐾) ∧ 𝐾 ≤ 𝑁) → (𝑁 ∈ ℕ0 → 𝜏))
41	1, 40	sylanb 284	. . 3 ⊢ ((𝐾 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁) → (𝑁 ∈ ℕ0 → 𝜏))
42	41	impcom 125	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝐾 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁)) → 𝜏)
43	42	3impb 1226	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ ℕ0 ∧ 𝐾 ≤ 𝑁) → 𝜏)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2202   class class class wbr 4093  (class class class)co 6028  ℝcr 8074  0cc0 8075  1c1 8076   + caddc 8078   < clt 8256   ≤ cle 8257  ℕ₀cn0 9444  ℤcz 9523

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-ltadd 8191

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-inn 9186  df-n0 9445  df-z 9524

This theorem is referenced by:  nn0seqcvgd  12676