zsupcllemstep - Intuitionistic Logic Explorer

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

Theorem zsupcllemstep 10319

Description: Lemma for zsupcl 10321. 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 9610	. . . . 5 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → 𝐾 ∈ ℤ)
2	1	ad3antrrr 492	. . . 4 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → 𝐾 ∈ ℤ)
3		nfv 1542	. . . . . . . 8 ⊢ Ⅎ𝑦 𝐾 ∈ (ℤ_≥‘𝑀)
4		nfv 1542	. . . . . . . . 9 ⊢ Ⅎ𝑦(𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓)
5		nfcv 2339	. . . . . . . . . 10 ⊢ Ⅎ𝑦ℤ
6		nfra1 2528	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦
7		nfra1 2528	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)
8	6, 7	nfan 1579	. . . . . . . . . 10 ⊢ Ⅎ𝑦(∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))
9	5, 8	nfrexya 2538	. . . . . . . . 9 ⊢ Ⅎ𝑦∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))
10	4, 9	nfim 1586	. . . . . . . 8 ⊢ Ⅎ𝑦((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
11	3, 10	nfan 1579	. . . . . . 7 ⊢ Ⅎ𝑦(𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
12		nfv 1542	. . . . . . 7 ⊢ Ⅎ𝑦(𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)
13	11, 12	nfan 1579	. . . . . 6 ⊢ Ⅎ𝑦((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓))
14		nfv 1542	. . . . . 6 ⊢ Ⅎ𝑦[𝐾 / 𝑛]𝜓
15	13, 14	nfan 1579	. . . . 5 ⊢ Ⅎ𝑦(((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓)
16		nfcv 2339	. . . . . . . . . . 11 ⊢ Ⅎ𝑛ℤ
17	16	elrabsf 3028	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ↔ (𝑦 ∈ ℤ ∧ [𝑦 / 𝑛]𝜓))
18	17	simprbi 275	. . . . . . . . 9 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → [𝑦 / 𝑛]𝜓)
19		sbsbc 2993	. . . . . . . . 9 ⊢ ([𝑦 / 𝑛]𝜓 ↔ [𝑦 / 𝑛]𝜓)
20	18, 19	sylibr 134	. . . . . . . 8 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → [𝑦 / 𝑛]𝜓)
21	20	ad2antlr 489	. . . . . . 7 ⊢ ((((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → [𝑦 / 𝑛]𝜓)
22		elrabi 2917	. . . . . . . . . . 11 ⊢ (𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} → 𝑦 ∈ ℤ)
23		zltp1le 9380	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝐾 < 𝑦 ↔ (𝐾 + 1) ≤ 𝑦))
24	2, 22, 23	syl2an 289	. . . . . . . . . 10 ⊢ (((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) → (𝐾 < 𝑦 ↔ (𝐾 + 1) ≤ 𝑦))
25	24	biimpa 296	. . . . . . . . 9 ⊢ ((((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓}) ∧ 𝐾 < 𝑦) → (𝐾 + 1) ≤ 𝑦)
26	2	peano2zd 9451	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → (𝐾 + 1) ∈ ℤ)
27		eluz 9614	. . . . . . . . . . 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 1958	. . . . . . . . . 10 ⊢ Ⅎ𝑛[𝑦 / 𝑛]𝜓
34	33	nfn 1672	. . . . . . . . 9 ⊢ Ⅎ𝑛 ¬ [𝑦 / 𝑛]𝜓
35		sbequ12 1785	. . . . . . . . . 10 ⊢ (𝑛 = 𝑦 → (𝜓 ↔ [𝑦 / 𝑛]𝜓))
36	35	notbid 668	. . . . . . . . 9 ⊢ (𝑛 = 𝑦 → (¬ 𝜓 ↔ ¬ [𝑦 / 𝑛]𝜓))
37	34, 36	rspc 2862	. . . . . . . 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 2568	. . . 4 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → ∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦)
42	2	ad2antrr 488	. . . . . . . 8 ⊢ ((((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → 𝐾 ∈ ℤ)
43		simpllr 534	. . . . . . . 8 ⊢ ((((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → [𝐾 / 𝑛]𝜓)
44	16	elrabsf 3028	. . . . . . . 8 ⊢ (𝐾 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ↔ (𝐾 ∈ ℤ ∧ [𝐾 / 𝑛]𝜓))
45	42, 43, 44	sylanbrc 417	. . . . . . 7 ⊢ ((((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → 𝐾 ∈ {𝑛 ∈ ℤ ∣ 𝜓})
46		breq2 4037	. . . . . . . 8 ⊢ (𝑧 = 𝐾 → (𝑦 < 𝑧 ↔ 𝑦 < 𝐾))
47	46	rspcev 2868	. . . . . . 7 ⊢ ((𝐾 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ∧ 𝑦 < 𝐾) → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)
48	45, 47	sylancom 420	. . . . . 6 ⊢ ((((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) ∧ 𝑦 ∈ ℝ) ∧ 𝑦 < 𝐾) → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)
49	48	exp31 364	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → (𝑦 ∈ ℝ → (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
50	15, 49	ralrimi 2568	. . . 4 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))
51		breq1 4036	. . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑥 < 𝑦 ↔ 𝐾 < 𝑦))
52	51	notbid 668	. . . . . . 7 ⊢ (𝑥 = 𝐾 → (¬ 𝑥 < 𝑦 ↔ ¬ 𝐾 < 𝑦))
53	52	ralbidv 2497	. . . . . 6 ⊢ (𝑥 = 𝐾 → (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ↔ ∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦))
54		breq2 4037	. . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑦 < 𝑥 ↔ 𝑦 < 𝐾))
55	54	imbi1d 231	. . . . . . 7 ⊢ (𝑥 = 𝐾 → ((𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧) ↔ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
56	55	ralbidv 2497	. . . . . 6 ⊢ (𝑥 = 𝐾 → (∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧) ↔ ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
57	53, 56	anbi12d 473	. . . . 5 ⊢ (𝑥 = 𝐾 → ((∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)) ↔ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
58	57	rspcev 2868	. . . 4 ⊢ ((𝐾 ∈ ℤ ∧ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝐾 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝐾 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
59	2, 41, 50, 58	syl12anc 1247	. . 3 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ [𝐾 / 𝑛]𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
60		sbcng 3030	. . . . . . . 8 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ¬ [𝐾 / 𝑛]𝜓))
61	60	ad2antrr 488	. . . . . . 7 ⊢ (((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ¬ [𝐾 / 𝑛]𝜓))
62	61	biimpar 297	. . . . . 6 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → [𝐾 / 𝑛] ¬ 𝜓)
63		sbcsng 3681	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ∀𝑛 ∈ {𝐾} ¬ 𝜓))
64	63	ad3antrrr 492	. . . . . 6 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ([𝐾 / 𝑛] ¬ 𝜓 ↔ ∀𝑛 ∈ {𝐾} ¬ 𝜓))
65	62, 64	mpbid 147	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ∀𝑛 ∈ {𝐾} ¬ 𝜓)
66		simplrr 536	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)
67		uzid 9615	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ (ℤ_≥‘𝐾))
68		peano2uz 9657	. . . . . . . . . . 11 ⊢ (𝐾 ∈ (ℤ_≥‘𝐾) → (𝐾 + 1) ∈ (ℤ_≥‘𝐾))
69	67, 68	syl 14	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → (𝐾 + 1) ∈ (ℤ_≥‘𝐾))
70		fzouzsplit 10255	. . . . . . . . . 10 ⊢ ((𝐾 + 1) ∈ (ℤ_≥‘𝐾) → (ℤ_≥‘𝐾) = ((𝐾..^(𝐾 + 1)) ∪ (ℤ_≥‘(𝐾 + 1))))
71	1, 69, 70	3syl 17	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝐾) = ((𝐾..^(𝐾 + 1)) ∪ (ℤ_≥‘(𝐾 + 1))))
72		fzosn 10281	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (𝐾..^(𝐾 + 1)) = {𝐾})
73	1, 72	syl 14	. . . . . . . . . 10 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → (𝐾..^(𝐾 + 1)) = {𝐾})
74	73	uneq1d 3316	. . . . . . . . 9 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → ((𝐾..^(𝐾 + 1)) ∪ (ℤ_≥‘(𝐾 + 1))) = ({𝐾} ∪ (ℤ_≥‘(𝐾 + 1))))
75	71, 74	eqtrd 2229	. . . . . . . 8 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝐾) = ({𝐾} ∪ (ℤ_≥‘(𝐾 + 1))))
76	75	raleqdv 2699	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → (∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓 ↔ ∀𝑛 ∈ ({𝐾} ∪ (ℤ_≥‘(𝐾 + 1))) ¬ 𝜓))
77		ralunb 3344	. . . . . . 7 ⊢ (∀𝑛 ∈ ({𝐾} ∪ (ℤ_≥‘(𝐾 + 1))) ¬ 𝜓 ↔ (∀𝑛 ∈ {𝐾} ¬ 𝜓 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓))
78	76, 77	bitrdi 196	. . . . . 6 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → (∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓 ↔ (∀𝑛 ∈ {𝐾} ¬ 𝜓 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)))
79	78	ad3antrrr 492	. . . . 5 ⊢ ((((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) ∧ ¬ [𝐾 / 𝑛]𝜓) → (∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓 ↔ (∀𝑛 ∈ {𝐾} ¬ 𝜓 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)))
80	65, 66, 79	mpbir2and 946	. . . 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 2570	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ (ℤ_≥‘𝑀)DECID 𝜓)
88	81, 87	syl 14	. . . . 5 ⊢ (((𝐾 ∈ (ℤ_≥‘𝑀) ∧ ((𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘𝐾) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))) ∧ (𝜑 ∧ ∀𝑛 ∈ (ℤ_≥‘(𝐾 + 1)) ¬ 𝜓)) → ∀𝑛 ∈ (ℤ_≥‘𝑀)DECID 𝜓)
89		nfsbc1v 3008	. . . . . . . 8 ⊢ Ⅎ𝑛[𝐾 / 𝑛]𝜓
90	89	nfdc 1673	. . . . . . 7 ⊢ Ⅎ𝑛DECID [𝐾 / 𝑛]𝜓
91		sbceq1a 2999	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → (𝜓 ↔ [𝐾 / 𝑛]𝜓))
92	91	dcbid 839	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (DECID 𝜓 ↔ DECID [𝐾 / 𝑛]𝜓))
93	90, 92	rspc 2862	. . . . . 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)) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 = wceq 1364 [wsb 1776 ∈ wcel 2167 ∀wral 2475 ∃wrex 2476 {crab 2479 [wsbc 2989 ∪ cun 3155 {csn 3622 class class class wbr 4033 ‘cfv 5258 (class class class)co 5922 ℝcr 7878 1c1 7880 + caddc 7882 < clt 8061 ≤ cle 8062 ℤcz 9326 ℤ_≥cuz 9601 ..^cfzo 10217

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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-cnex 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-addcom 7979 ax-addass 7981 ax-distr 7983 ax-i2m1 7984 ax-0lt1 7985 ax-0id 7987 ax-rnegex 7988 ax-cnre 7990 ax-pre-ltirr 7991 ax-pre-ltwlin 7992 ax-pre-lttrn 7993 ax-pre-apti 7994 ax-pre-ltadd 7995

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-br 4034 df-opab 4095 df-mpt 4096 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-1st 6198 df-2nd 6199 df-pnf 8063 df-mnf 8064 df-xr 8065 df-ltxr 8066 df-le 8067 df-sub 8199 df-neg 8200 df-inn 8991 df-n0 9250 df-z 9327 df-uz 9602 df-fz 10084 df-fzo 10218

This theorem is referenced by: zsupcllemex 10320

W3C validator