Theorem uzsinds 10215

Description: Strong (or "total") induction principle over an upper set of integers. (Contributed by Scott Fenton, 16-May-2014.)

Hypotheses

Ref	Expression
uzsinds.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
uzsinds.2	⊢ (𝑥 = 𝑁 → (𝜑 ↔ 𝜒))
uzsinds.3	⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑))

Assertion

Ref	Expression
uzsinds	⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝜒)

Distinct variable groups:   𝜒,𝑥   𝑥,𝑀,𝑦   𝑥,𝑁   𝜑,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝑁(𝑦)

Proof of Theorem uzsinds

Dummy variables 𝑘 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uzsinds.2	. 2 ⊢ (𝑥 = 𝑁 → (𝜑 ↔ 𝜒))
2		oveq2 5782	. . . 4 ⊢ (𝑤 = 𝑀 → (𝑀...𝑤) = (𝑀...𝑀))
3	2	raleqdv 2632	. . 3 ⊢ (𝑤 = 𝑀 → (∀𝑥 ∈ (𝑀...𝑤)𝜑 ↔ ∀𝑥 ∈ (𝑀...𝑀)𝜑))
4		oveq2 5782	. . . 4 ⊢ (𝑤 = 𝑘 → (𝑀...𝑤) = (𝑀...𝑘))
5	4	raleqdv 2632	. . 3 ⊢ (𝑤 = 𝑘 → (∀𝑥 ∈ (𝑀...𝑤)𝜑 ↔ ∀𝑥 ∈ (𝑀...𝑘)𝜑))
6		oveq2 5782	. . . 4 ⊢ (𝑤 = (𝑘 + 1) → (𝑀...𝑤) = (𝑀...(𝑘 + 1)))
7	6	raleqdv 2632	. . 3 ⊢ (𝑤 = (𝑘 + 1) → (∀𝑥 ∈ (𝑀...𝑤)𝜑 ↔ ∀𝑥 ∈ (𝑀...(𝑘 + 1))𝜑))
8		oveq2 5782	. . . 4 ⊢ (𝑤 = 𝑁 → (𝑀...𝑤) = (𝑀...𝑁))
9	8	raleqdv 2632	. . 3 ⊢ (𝑤 = 𝑁 → (∀𝑥 ∈ (𝑀...𝑤)𝜑 ↔ ∀𝑥 ∈ (𝑀...𝑁)𝜑))
10		ral0 3464	. . . . . . 7 ⊢ ∀𝑦 ∈ ∅ 𝜓
11		zre 9058	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
12	11	ltm1d 8690	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) < 𝑀)
13		peano2zm 9092	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ)
14		fzn 9822	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ (𝑀 − 1) ∈ ℤ) → ((𝑀 − 1) < 𝑀 ↔ (𝑀...(𝑀 − 1)) = ∅))
15	13, 14	mpdan 417	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → ((𝑀 − 1) < 𝑀 ↔ (𝑀...(𝑀 − 1)) = ∅))
16	12, 15	mpbid 146	. . . . . . . 8 ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 − 1)) = ∅)
17	16	raleqdv 2632	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓 ↔ ∀𝑦 ∈ ∅ 𝜓))
18	10, 17	mpbiri 167	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓)
19		uzid 9340	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
20		uzsinds.3	. . . . . . . 8 ⊢ (𝑥 ∈ (ℤ≥‘𝑀) → (∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑))
21	20	rgen 2485	. . . . . . 7 ⊢ ∀𝑥 ∈ (ℤ≥‘𝑀)(∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑)
22		nfv 1508	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓
23		nfsbc1v 2927	. . . . . . . . 9 ⊢ Ⅎ𝑥[𝑀 / 𝑥]𝜑
24	22, 23	nfim 1551	. . . . . . . 8 ⊢ Ⅎ𝑥(∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓 → [𝑀 / 𝑥]𝜑)
25		oveq1 5781	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑀 → (𝑥 − 1) = (𝑀 − 1))
26	25	oveq2d 5790	. . . . . . . . . 10 ⊢ (𝑥 = 𝑀 → (𝑀...(𝑥 − 1)) = (𝑀...(𝑀 − 1)))
27	26	raleqdv 2632	. . . . . . . . 9 ⊢ (𝑥 = 𝑀 → (∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 ↔ ∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓))
28		sbceq1a 2918	. . . . . . . . 9 ⊢ (𝑥 = 𝑀 → (𝜑 ↔ [𝑀 / 𝑥]𝜑))
29	27, 28	imbi12d 233	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → ((∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑) ↔ (∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓 → [𝑀 / 𝑥]𝜑)))
30	24, 29	rspc 2783	. . . . . . 7 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (∀𝑥 ∈ (ℤ≥‘𝑀)(∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑) → (∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓 → [𝑀 / 𝑥]𝜑)))
31	19, 21, 30	mpisyl 1422	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (∀𝑦 ∈ (𝑀...(𝑀 − 1))𝜓 → [𝑀 / 𝑥]𝜑))
32	18, 31	mpd 13	. . . . 5 ⊢ (𝑀 ∈ ℤ → [𝑀 / 𝑥]𝜑)
33		ralsns 3562	. . . . 5 ⊢ (𝑀 ∈ ℤ → (∀𝑥 ∈ {𝑀}𝜑 ↔ [𝑀 / 𝑥]𝜑))
34	32, 33	mpbird 166	. . . 4 ⊢ (𝑀 ∈ ℤ → ∀𝑥 ∈ {𝑀}𝜑)
35		fzsn 9846	. . . . 5 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀})
36	35	raleqdv 2632	. . . 4 ⊢ (𝑀 ∈ ℤ → (∀𝑥 ∈ (𝑀...𝑀)𝜑 ↔ ∀𝑥 ∈ {𝑀}𝜑))
37	34, 36	mpbird 166	. . 3 ⊢ (𝑀 ∈ ℤ → ∀𝑥 ∈ (𝑀...𝑀)𝜑)
38		simpr 109	. . . . . 6 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → ∀𝑥 ∈ (𝑀...𝑘)𝜑)
39		uzsinds.1	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
40	39	cbvralv 2654	. . . . . . . . 9 ⊢ (∀𝑥 ∈ (𝑀...𝑘)𝜑 ↔ ∀𝑦 ∈ (𝑀...𝑘)𝜓)
41	38, 40	sylib 121	. . . . . . . 8 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → ∀𝑦 ∈ (𝑀...𝑘)𝜓)
42		eluzelz 9335	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → 𝑘 ∈ ℤ)
43	42	adantr 274	. . . . . . . . . . . . 13 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → 𝑘 ∈ ℤ)
44	43	zcnd 9174	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → 𝑘 ∈ ℂ)
45		1cnd 7782	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → 1 ∈ ℂ)
46	44, 45	pncand 8074	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → ((𝑘 + 1) − 1) = 𝑘)
47	46	oveq2d 5790	. . . . . . . . . 10 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (𝑀...((𝑘 + 1) − 1)) = (𝑀...𝑘))
48	47	raleqdv 2632	. . . . . . . . 9 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓 ↔ ∀𝑦 ∈ (𝑀...𝑘)𝜓))
49		peano2uz 9378	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝑘 + 1) ∈ (ℤ≥‘𝑀))
50	49	adantr 274	. . . . . . . . . 10 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (𝑘 + 1) ∈ (ℤ≥‘𝑀))
51		nfv 1508	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓
52		nfsbc1v 2927	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥[(𝑘 + 1) / 𝑥]𝜑
53	51, 52	nfim 1551	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓 → [(𝑘 + 1) / 𝑥]𝜑)
54		oveq1 5781	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑘 + 1) → (𝑥 − 1) = ((𝑘 + 1) − 1))
55	54	oveq2d 5790	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑘 + 1) → (𝑀...(𝑥 − 1)) = (𝑀...((𝑘 + 1) − 1)))
56	55	raleqdv 2632	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑘 + 1) → (∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 ↔ ∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓))
57		sbceq1a 2918	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑘 + 1) → (𝜑 ↔ [(𝑘 + 1) / 𝑥]𝜑))
58	56, 57	imbi12d 233	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑘 + 1) → ((∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑) ↔ (∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓 → [(𝑘 + 1) / 𝑥]𝜑)))
59	53, 58	rspc 2783	. . . . . . . . . 10 ⊢ ((𝑘 + 1) ∈ (ℤ≥‘𝑀) → (∀𝑥 ∈ (ℤ≥‘𝑀)(∀𝑦 ∈ (𝑀...(𝑥 − 1))𝜓 → 𝜑) → (∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓 → [(𝑘 + 1) / 𝑥]𝜑)))
60	50, 21, 59	mpisyl 1422	. . . . . . . . 9 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (∀𝑦 ∈ (𝑀...((𝑘 + 1) − 1))𝜓 → [(𝑘 + 1) / 𝑥]𝜑))
61	48, 60	sylbird 169	. . . . . . . 8 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (∀𝑦 ∈ (𝑀...𝑘)𝜓 → [(𝑘 + 1) / 𝑥]𝜑))
62	41, 61	mpd 13	. . . . . . 7 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → [(𝑘 + 1) / 𝑥]𝜑)
63	42	peano2zd 9176	. . . . . . . . 9 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝑘 + 1) ∈ ℤ)
64	63	adantr 274	. . . . . . . 8 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (𝑘 + 1) ∈ ℤ)
65		ralsns 3562	. . . . . . . 8 ⊢ ((𝑘 + 1) ∈ ℤ → (∀𝑥 ∈ {(𝑘 + 1)}𝜑 ↔ [(𝑘 + 1) / 𝑥]𝜑))
66	64, 65	syl 14	. . . . . . 7 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (∀𝑥 ∈ {(𝑘 + 1)}𝜑 ↔ [(𝑘 + 1) / 𝑥]𝜑))
67	62, 66	mpbird 166	. . . . . 6 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → ∀𝑥 ∈ {(𝑘 + 1)}𝜑)
68		ralun 3258	. . . . . 6 ⊢ ((∀𝑥 ∈ (𝑀...𝑘)𝜑 ∧ ∀𝑥 ∈ {(𝑘 + 1)}𝜑) → ∀𝑥 ∈ ((𝑀...𝑘) ∪ {(𝑘 + 1)})𝜑)
69	38, 67, 68	syl2anc 408	. . . . 5 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → ∀𝑥 ∈ ((𝑀...𝑘) ∪ {(𝑘 + 1)})𝜑)
70		fzsuc 9849	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝑀...(𝑘 + 1)) = ((𝑀...𝑘) ∪ {(𝑘 + 1)}))
71	70	raleqdv 2632	. . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (∀𝑥 ∈ (𝑀...(𝑘 + 1))𝜑 ↔ ∀𝑥 ∈ ((𝑀...𝑘) ∪ {(𝑘 + 1)})𝜑))
72	71	adantr 274	. . . . 5 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → (∀𝑥 ∈ (𝑀...(𝑘 + 1))𝜑 ↔ ∀𝑥 ∈ ((𝑀...𝑘) ∪ {(𝑘 + 1)})𝜑))
73	69, 72	mpbird 166	. . . 4 ⊢ ((𝑘 ∈ (ℤ≥‘𝑀) ∧ ∀𝑥 ∈ (𝑀...𝑘)𝜑) → ∀𝑥 ∈ (𝑀...(𝑘 + 1))𝜑)
74	73	ex 114	. . 3 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (∀𝑥 ∈ (𝑀...𝑘)𝜑 → ∀𝑥 ∈ (𝑀...(𝑘 + 1))𝜑))
75	3, 5, 7, 9, 37, 74	uzind4 9383	. 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ∀𝑥 ∈ (𝑀...𝑁)𝜑)
76		eluzfz2 9812	. 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
77	1, 75, 76	rspcdva 2794	1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝜒)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331   ∈ wcel 1480  ∀wral 2416  [wsbc 2909   ∪ cun 3069  ∅c0 3363  {csn 3527   class class class wbr 3929  ‘cfv 5123  (class class class)co 5774  1c1 7621   + caddc 7623   < clt 7800   − cmin 7933  ℤcz 9054  ℤ_≥cuz 9326  ...cfz 9790

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-addcom 7720  ax-addass 7722  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-0id 7728  ax-rnegex 7729  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736

This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-inn 8721  df-n0 8978  df-z 9055  df-uz 9327  df-fz 9791

This theorem is referenced by:  nnsinds  10216  nn0sinds  10217