Theorem zsupcllemex 10612

Description: Lemma for zsupcl 10613. Existence of the supremum. (Contributed by Jim Kingdon, 7-Dec-2021.)

Hypotheses

Ref	Expression
zsupcllemex.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
zsupcllemex.sbm	⊢ (𝑛 = 𝑀 → (𝜓 ↔ 𝜒))
zsupcllemex.mtru	⊢ (𝜑 → 𝜒)
zsupcllemex.dc	⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → DECID 𝜓)
zsupcllemex.bnd	⊢ (𝜑 → ∃𝑗 ∈ (ℤ≥‘𝑀)∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)

Assertion

Ref	Expression
zsupcllemex	⊢ (𝜑 → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))

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

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

Proof of Theorem zsupcllemex

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

Step	Hyp	Ref	Expression
1		zsupcllemex.bnd	. 2 ⊢ (𝜑 → ∃𝑗 ∈ (ℤ≥‘𝑀)∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)
2		simpl 109	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ (ℤ≥‘𝑀) ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)) → 𝜑)
3		simprr 533	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ (ℤ≥‘𝑀) ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)) → ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)
4		fveq2 5675	. . . . . . . 8 ⊢ (𝑤 = 𝑀 → (ℤ≥‘𝑤) = (ℤ≥‘𝑀))
5	4	raleqdv 2749	. . . . . . 7 ⊢ (𝑤 = 𝑀 → (∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓 ↔ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓))
6	5	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑀 → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) ↔ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓)))
7	6	imbi1d 231	. . . . 5 ⊢ (𝑤 = 𝑀 → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) ↔ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))
8		fveq2 5675	. . . . . . . 8 ⊢ (𝑤 = 𝑘 → (ℤ≥‘𝑤) = (ℤ≥‘𝑘))
9	8	raleqdv 2749	. . . . . . 7 ⊢ (𝑤 = 𝑘 → (∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓 ↔ ∀𝑛 ∈ (ℤ≥‘𝑘) ¬ 𝜓))
10	9	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑘 → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) ↔ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑘) ¬ 𝜓)))
11	10	imbi1d 231	. . . . 5 ⊢ (𝑤 = 𝑘 → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) ↔ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑘) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))
12		fveq2 5675	. . . . . . . 8 ⊢ (𝑤 = (𝑘 + 1) → (ℤ≥‘𝑤) = (ℤ≥‘(𝑘 + 1)))
13	12	raleqdv 2749	. . . . . . 7 ⊢ (𝑤 = (𝑘 + 1) → (∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓 ↔ ∀𝑛 ∈ (ℤ≥‘(𝑘 + 1)) ¬ 𝜓))
14	13	anbi2d 464	. . . . . 6 ⊢ (𝑤 = (𝑘 + 1) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) ↔ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝑘 + 1)) ¬ 𝜓)))
15	14	imbi1d 231	. . . . 5 ⊢ (𝑤 = (𝑘 + 1) → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) ↔ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝑘 + 1)) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))
16		fveq2 5675	. . . . . . . 8 ⊢ (𝑤 = 𝑗 → (ℤ≥‘𝑤) = (ℤ≥‘𝑗))
17	16	raleqdv 2749	. . . . . . 7 ⊢ (𝑤 = 𝑗 → (∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓 ↔ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓))
18	17	anbi2d 464	. . . . . 6 ⊢ (𝑤 = 𝑗 → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) ↔ (𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)))
19	18	imbi1d 231	. . . . 5 ⊢ (𝑤 = 𝑗 → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑤) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) ↔ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))
20		zsupcllemex.mtru	. . . . . . . 8 ⊢ (𝜑 → 𝜒)
21	20	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓) → 𝜒)
22		zsupcllemex.m	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
23		uzid 9886	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
24		zsupcllemex.sbm	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑀 → (𝜓 ↔ 𝜒))
25	24	notbid 673	. . . . . . . . . 10 ⊢ (𝑛 = 𝑀 → (¬ 𝜓 ↔ ¬ 𝜒))
26	25	rspcv 2919	. . . . . . . . 9 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓 → ¬ 𝜒))
27	22, 23, 26	3syl 17	. . . . . . . 8 ⊢ (𝜑 → (∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓 → ¬ 𝜒))
28	27	imp 124	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓) → ¬ 𝜒)
29	21, 28	pm2.21dd 625	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
30	29	a1i 9	. . . . 5 ⊢ (𝑀 ∈ ℤ → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
31		zsupcllemex.dc	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → DECID 𝜓)
32	31	zsupcllemstep 10611	. . . . 5 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑘) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘(𝑘 + 1)) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))))
33	7, 11, 15, 19, 30, 32	uzind4 9938	. . . 4 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
34	33	ad2antrl 490	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ (ℤ≥‘𝑀) ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)) → ((𝜑 ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧))))
35	2, 3, 34	mp2and 433	. 2 ⊢ ((𝜑 ∧ (𝑗 ∈ (ℤ≥‘𝑀) ∧ ∀𝑛 ∈ (ℤ≥‘𝑗) ¬ 𝜓)) → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))
36	1, 35	rexlimddv 2667	1 ⊢ (𝜑 → ∃𝑥 ∈ ℤ (∀𝑦 ∈ {𝑛 ∈ ℤ ∣ 𝜓} ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ {𝑛 ∈ ℤ ∣ 𝜓}𝑦 < 𝑧)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 842   = wceq 1398   ∈ wcel 2205  ∀wral 2522  ∃wrex 2523  {crab 2526   class class class wbr 4114  ‘cfv 5357  (class class class)co 6058  ℝcr 8142  1c1 8144   + caddc 8146   < clt 8324  ℤcz 9594  ℤ_≥cuz 9871

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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-fz 10362  df-fzo 10499

This theorem is referenced by:  zsupcl  10613  infssuzex  10615  gcdsupex  12678