Theorem zsupcllemstep 11960

Description: Lemma for zsupcl 11962. Induction step. (Contributed by Jim Kingdon, 7-Dec-2021.)

Hypothesis

Ref	Expression
zsupcllemstep.dc	⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → DECID 𝜓)

Assertion

Ref	Expression
zsupcllemstep	⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))

Distinct variable groups:   𝑛,𝐾,𝑥,𝑦,𝑧   𝑛,𝑀,𝑦   𝜑,𝑛,𝑦   𝜓,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑧)   𝜓(𝑛)   𝑀(𝑥,𝑧)

Proof of Theorem zsupcllemstep

Step	Hyp	Ref	Expression
1		eluzelz 9551	. . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ)
2	1	ad3antrrr 492	. . . 4 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → 𝐾 ∈ ℤ)
3		nfv 1538	. . . . . . . 8 ⊢ Ⅎ𝑦 𝐾 ∈ (ℤ≥‘𝑀)
4		nfv 1538	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓)
5		nfcv 2329	. . . . . . . . . 10 ⊢ Ⅎ𝑦ℤ
6		nfra1 2518	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦
7		nfra1 2518	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)
8	6, 7	nfan 1575	. . . . . . . . . 10 ⊢ Ⅎ𝑦(∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))
9	5, 8	nfrexya 2528	. . . . . . . . 9 ⊢ Ⅎ𝑦∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))
10	4, 9	nfim 1582	. . . . . . . 8 ⊢ Ⅎ𝑦((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
11	3, 10	nfan 1575	. . . . . . 7 ⊢ Ⅎ𝑦(𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
12		nfv 1538	. . . . . . 7 ⊢ Ⅎ𝑦(𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)
13	11, 12	nfan 1575	. . . . . 6 ⊢ Ⅎ𝑦((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓))
14		nfv 1538	. . . . . 6 ⊢ Ⅎ𝑦[𝐾 / 𝑛]𝜓
15	13, 14	nfan 1575	. . . . 5 ⊢ Ⅎ𝑦(((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓)
16		nfcv 2329	. . . . . . . . . . 11 ⊢ Ⅎ𝑛ℤ
17	16	elrabsf 3013	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ↔ (𝑦 ∈ ℤ ∧ [𝑦 / 𝑛]𝜓))
18	17	simprbi 275	. . . . . . . . 9 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → [𝑦 / 𝑛]𝜓)
19		sbsbc 2978	. . . . . . . . 9 ⊢ ([𝑦 / 𝑛]𝜓 ↔ [𝑦 / 𝑛]𝜓)
20	18, 19	sylibr 134	. . . . . . . 8 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → [𝑦 / 𝑛]𝜓)
21	20	ad2antlr 489	. . . . . . 7 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → [𝑦 / 𝑛]𝜓)
22		elrabi 2902	. . . . . . . . . . 11 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → 𝑦 ∈ ℤ)
23		zltp1le 9321	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝐾 < 𝑦 ↔ (𝐾 + 1) ≤ 𝑦))
24	2, 22, 23	syl2an 289	. . . . . . . . . 10 ⊢ (((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) → (𝐾 < 𝑦 ↔ (𝐾 + 1) ≤ 𝑦))
25	24	biimpa 296	. . . . . . . . 9 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → (𝐾 + 1) ≤ 𝑦)
26	2	peano2zd 9392	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → (𝐾 + 1) ∈ ℤ)
27		eluz 9555	. . . . . . . . . . 11 ⊢ (((𝐾 + 1) ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑦 ∈ (ℤ≥‘(𝐾 + 1)) ↔ (𝐾 + 1) ≤ 𝑦))
28	26, 22, 27	syl2an 289	. . . . . . . . . 10 ⊢ (((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) → (𝑦 ∈ (ℤ≥‘(𝐾 + 1)) ↔ (𝐾 + 1) ≤ 𝑦))
29	28	adantr 276	. . . . . . . . 9 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → (𝑦 ∈ (ℤ≥‘(𝐾 + 1)) ↔ (𝐾 + 1) ≤ 𝑦))
30	25, 29	mpbird 167	. . . . . . . 8 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → 𝑦 ∈ (ℤ≥‘(𝐾 + 1)))
31		simprr 531	. . . . . . . . 9 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)
32	31	ad3antrrr 492	. . . . . . . 8 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)
33		nfs1v 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑛[𝑦 / 𝑛]𝜓
34	33	nfn 1668	. . . . . . . . 9 ⊢ Ⅎ𝑛 ¬ [𝑦 / 𝑛]𝜓
35		sbequ12 1781	. . . . . . . . . 10 ⊢ (𝑛 = 𝑦 → (𝜓 ↔ [𝑦 / 𝑛]𝜓))
36	35	notbid 668	. . . . . . . . 9 ⊢ (𝑛 = 𝑦 → (¬ 𝜓 ↔ ¬ [𝑦 / 𝑛]𝜓))
37	34, 36	rspc 2847	. . . . . . . 8 ⊢ (𝑦 ∈ (ℤ≥‘(𝐾 + 1)) → (∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓 → ¬ [𝑦 / 𝑛]𝜓))
38	30, 32, 37	sylc 62	. . . . . . 7 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → ¬ [𝑦 / 𝑛]𝜓)
39	21, 38	pm2.65da 662	. . . . . 6 ⊢ (((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) → ¬ 𝐾 < 𝑦)
40	39	ex 115	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → ¬ 𝐾 < 𝑦))
41	15, 40	ralrimi 2558	. . . 4 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → ∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦)
42	2	ad2antrr 488	. . . . . . . 8 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → 𝐾 ∈ ℤ)
43		simpllr 534	. . . . . . . 8 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → [𝐾 / 𝑛]𝜓)
44	16	elrabsf 3013	. . . . . . . 8 ⊢ (𝐾 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ↔ (𝐾 ∈ ℤ ∧ [𝐾 / 𝑛]𝜓))
45	42, 43, 44	sylanbrc 417	. . . . . . 7 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → 𝐾 ∈ {𝑛 ∈ ℤ ∣ 𝜓})
46		breq2 4019	. . . . . . . 8 ⊢ (𝑧 = 𝐾 → (𝑦 < 𝑧 ↔ 𝑦 < 𝐾))
47	46	rspcev 2853	. . . . . . 7 ⊢ ((𝐾 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ∧ 𝑦 < 𝐾) → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)
48	45, 47	sylancom 420	. . . . . 6 ⊢ ((((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)
49	48	exp31 364	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → (𝑦 ∈ ℝ → (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
50	15, 49	ralrimi 2558	. . . 4 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))
51		breq1 4018	. . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑥 < 𝑦 ↔ 𝐾 < 𝑦))
52	51	notbid 668	. . . . . . 7 ⊢ (𝑥 = 𝐾 → (¬ 𝑥 < 𝑦 ↔ ¬ 𝐾 < 𝑦))
53	52	ralbidv 2487	. . . . . 6 ⊢ (𝑥 = 𝐾 → (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ↔ ∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦))
54		breq2 4019	. . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑦 < 𝑥 ↔ 𝑦 < 𝐾))
55	54	imbi1d 231	. . . . . . 7 ⊢ (𝑥 = 𝐾 → ((𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧) ↔ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
56	55	ralbidv 2487	. . . . . 6 ⊢ (𝑥 = 𝐾 → (∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧) ↔ ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
57	53, 56	anbi12d 473	. . . . 5 ⊢ (𝑥 = 𝐾 → ((∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)) ↔ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
58	57	rspcev 2853	. . . 4 ⊢ ((𝐾 ∈ ℤ ∧ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
59	2, 41, 50, 58	syl12anc 1246	. . 3 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
60		sbcng 3015	. . . . . . . 8 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ¬ [𝐾 / 𝑛]𝜓))
61	60	ad2antrr 488	. . . . . . 7 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ¬ [𝐾 / 𝑛]𝜓))
62	61	biimpar 297	. . . . . 6 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → [𝐾 / 𝑛] ¬ 𝜓)
63		sbcsng 3663	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ∀𝑛 ∈ {𝐾} ¬ 𝜓))
64	63	ad3antrrr 492	. . . . . 6 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ∀𝑛 ∈ {𝐾} ¬ 𝜓))
65	62, 64	mpbid 147	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ∀𝑛 ∈ {𝐾} ¬ 𝜓)
66		simplrr 536	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)
67		uzid 9556	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ (ℤ≥‘𝐾))
68		peano2uz 9597	. . . . . . . . . . 11 ⊢ (𝐾 ∈ (ℤ≥‘𝐾) → (𝐾 + 1) ∈ (ℤ≥‘𝐾))
69	67, 68	syl 14	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → (𝐾 + 1) ∈ (ℤ≥‘𝐾))
70		fzouzsplit 10193	. . . . . . . . . 10 ⊢ ((𝐾 + 1) ∈ (ℤ≥‘𝐾) → (ℤ≥‘𝐾) = ((𝐾..^(𝐾 + 1)) ∪ (ℤ≥‘(𝐾 + 1))))
71	1, 69, 70	3syl 17	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝐾) = ((𝐾..^(𝐾 + 1)) ∪ (ℤ≥‘(𝐾 + 1))))
72		fzosn 10219	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (𝐾..^(𝐾 + 1)) = {𝐾})
73	1, 72	syl 14	. . . . . . . . . 10 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (𝐾..^(𝐾 + 1)) = {𝐾})
74	73	uneq1d 3300	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → ((𝐾..^(𝐾 + 1)) ∪ (ℤ≥‘(𝐾 + 1))) = ({𝐾} ∪ (ℤ≥‘(𝐾 + 1))))
75	71, 74	eqtrd 2220	. . . . . . . 8 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝐾) = ({𝐾} ∪ (ℤ≥‘(𝐾 + 1))))
76	75	raleqdv 2689	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓 ↔ ∀𝑛 ∈ ({𝐾} ∪ (ℤ≥‘(𝐾 + 1))) ¬ 𝜓))
77		ralunb 3328	. . . . . . 7 ⊢ (∀𝑛 ∈ ({𝐾} ∪ (ℤ≥‘(𝐾 + 1))) ¬ 𝜓 ↔ (∀𝑛 ∈ {𝐾} ¬ 𝜓 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓))
78	76, 77	bitrdi 196	. . . . . 6 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓 ↔ (∀𝑛 ∈ {𝐾} ¬ 𝜓 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)))
79	78	ad3antrrr 492	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → (∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓 ↔ (∀𝑛 ∈ {𝐾} ¬ 𝜓 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)))
80	65, 66, 79	mpbir2and 945	. . . 4 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓)
81		simprl 529	. . . . . 6 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → 𝜑)
82		simplr 528	. . . . . 6 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
83	81, 82	mpand 429	. . . . 5 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → (∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓 → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
84	83	adantr 276	. . . 4 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → (∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓 → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
85	80, 84	mpd 13	. . 3 ⊢ ((((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
86		zsupcllemstep.dc	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → DECID 𝜓)
87	86	ralrimiva 2560	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ (ℤ≥‘𝑀)DECID 𝜓)
88	81, 87	syl 14	. . . . 5 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → ∀𝑛 ∈ (ℤ≥‘𝑀)DECID 𝜓)
89		nfsbc1v 2993	. . . . . . . 8 ⊢ Ⅎ𝑛[𝐾 / 𝑛]𝜓
90	89	nfdc 1669	. . . . . . 7 ⊢ Ⅎ𝑛DECID [𝐾 / 𝑛]𝜓
91		sbceq1a 2984	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → (𝜓 ↔ [𝐾 / 𝑛]𝜓))
92	91	dcbid 839	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (DECID 𝜓 ↔ DECID [𝐾 / 𝑛]𝜓))
93	90, 92	rspc 2847	. . . . . 6 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (∀𝑛 ∈ (ℤ≥‘𝑀)DECID 𝜓 → DECID [𝐾 / 𝑛]𝜓))
94	93	ad2antrr 488	. . . . 5 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → (∀𝑛 ∈ (ℤ≥‘𝑀)DECID 𝜓 → DECID [𝐾 / 𝑛]𝜓))
95	88, 94	mpd 13	. . . 4 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → DECID [𝐾 / 𝑛]𝜓)
96		exmiddc 837	. . . 4 ⊢ (DECID [𝐾 / 𝑛]𝜓 → ([𝐾 / 𝑛]𝜓 ∨ ¬ [𝐾 / 𝑛]𝜓))
97	95, 96	syl 14	. . 3 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → ([𝐾 / 𝑛]𝜓 ∨ ¬ [𝐾 / 𝑛]𝜓))
98	59, 85, 97	mpjaodan 799	. 2 ⊢ (((𝐾 ∈ (ℤ≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓)) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
99	98	exp31 364	1 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝐾 + 1)) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 709  DECID wdc 835   = wceq 1363  [wsb 1772   ∈ wcel 2158  ∀wral 2465  ∃wrex 2466  {crab 2469  [wsbc 2974   ∪ cun 3139  {csn 3604   class class class wbr 4015  ‘cfv 5228  (class class class)co 5888  ℝcr 7824  1c1 7826   + caddc 7828   < clt 8006   ≤ cle 8007  ℤcz 9267  ℤ_≥cuz 9542  ..^cfzo 10156

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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7916  ax-resscn 7917  ax-1cn 7918  ax-1re 7919  ax-icn 7920  ax-addcl 7921  ax-addrcl 7922  ax-mulcl 7923  ax-addcom 7925  ax-addass 7927  ax-distr 7929  ax-i2m1 7930  ax-0lt1 7931  ax-0id 7933  ax-rnegex 7934  ax-cnre 7936  ax-pre-ltirr 7937  ax-pre-ltwlin 7938  ax-pre-lttrn 7939  ax-pre-apti 7940  ax-pre-ltadd 7941

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-fv 5236  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6155  df-2nd 6156  df-pnf 8008  df-mnf 8009  df-xr 8010  df-ltxr 8011  df-le 8012  df-sub 8144  df-neg 8145  df-inn 8934  df-n0 9191  df-z 9268  df-uz 9543  df-fz 10023  df-fzo 10157

This theorem is referenced by:  zsupcllemex  11961