Theorem infssfzcldc 10671

Description: The infimum of a decidable inhabited subset of an integer range is a member of the set. (Contributed by Jim Kingdon, 12-Jun-2026.)

Hypotheses

Ref	Expression
infssfzledc.s	⊢ 𝑆 = {𝑛 ∈ (𝑀...𝑁) ∣ 𝜓}
infssfzledc.a	⊢ (𝜑 → 𝐴 ∈ 𝑆)
infssfzledc.dc	⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀...𝐴)) → DECID 𝜓)

Assertion

Ref	Expression
infssfzcldc	⊢ (𝜑 → inf(𝑆, ℝ, < ) ∈ 𝑆)

Distinct variable groups:   𝐴,𝑛   𝑛,𝑀   𝑛,𝑁   𝜑,𝑛

Allowed substitution hints:   𝜓(𝑛)   𝑆(𝑛)

Proof of Theorem infssfzcldc

Step	Hyp	Ref	Expression
1		infssfzledc.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
2		infssfzledc.s	. . . . . . . 8 ⊢ 𝑆 = {𝑛 ∈ (𝑀...𝑁) ∣ 𝜓}
3	2	eleq2i 2305	. . . . . . 7 ⊢ (𝐴 ∈ 𝑆 ↔ 𝐴 ∈ {𝑛 ∈ (𝑀...𝑁) ∣ 𝜓})
4		nfcv 2392	. . . . . . . 8 ⊢ Ⅎ𝑛(𝑀...𝑁)
5	4	elrabsf 3090	. . . . . . 7 ⊢ (𝐴 ∈ {𝑛 ∈ (𝑀...𝑁) ∣ 𝜓} ↔ (𝐴 ∈ (𝑀...𝑁) ∧ [𝐴 / 𝑛]𝜓))
6	3, 5	bitri 184	. . . . . 6 ⊢ (𝐴 ∈ 𝑆 ↔ (𝐴 ∈ (𝑀...𝑁) ∧ [𝐴 / 𝑛]𝜓))
7	1, 6	sylib 122	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ (𝑀...𝑁) ∧ [𝐴 / 𝑛]𝜓))
8	7	simpld 112	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝑀...𝑁))
9		elfzel1 10429	. . . 4 ⊢ (𝐴 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
10	8, 9	syl 14	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
11		eqid 2238	. . 3 ⊢ {𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)} = {𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)}
12		elfzuz 10426	. . . . . . . . 9 ⊢ (𝑛 ∈ (𝑀...𝑁) → 𝑛 ∈ (ℤ≥‘𝑀))
13	12	ad2antrl 494	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (𝑀...𝑁) ∧ 𝜓)) → 𝑛 ∈ (ℤ≥‘𝑀))
14		elfzle2 10434	. . . . . . . . 9 ⊢ (𝑛 ∈ (𝑀...𝑁) → 𝑛 ≤ 𝑁)
15	14	ad2antrl 494	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (𝑀...𝑁) ∧ 𝜓)) → 𝑛 ≤ 𝑁)
16		simprr 537	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (𝑀...𝑁) ∧ 𝜓)) → 𝜓)
17	13, 15, 16	jca32 310	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (𝑀...𝑁) ∧ 𝜓)) → (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓)))
18		simprl 535	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → 𝑛 ∈ (ℤ≥‘𝑀))
19		simprrl 545	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → 𝑛 ≤ 𝑁)
20		eluzelz 9933	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → 𝑛 ∈ ℤ)
21	20	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓)) → 𝑛 ∈ ℤ)
22		elfzel2 10428	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ)
23	8, 22	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℤ)
24		eluz 9937	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑛) ↔ 𝑛 ≤ 𝑁))
25	21, 23, 24	syl2anr 290	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → (𝑁 ∈ (ℤ≥‘𝑛) ↔ 𝑛 ≤ 𝑁))
26	19, 25	mpbird 167	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → 𝑁 ∈ (ℤ≥‘𝑛))
27		elfzuzb 10424	. . . . . . . . 9 ⊢ (𝑛 ∈ (𝑀...𝑁) ↔ (𝑛 ∈ (ℤ≥‘𝑀) ∧ 𝑁 ∈ (ℤ≥‘𝑛)))
28	18, 26, 27	sylanbrc 421	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → 𝑛 ∈ (𝑀...𝑁))
29		simprrr 546	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → 𝜓)
30	28, 29	jca 306	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))) → (𝑛 ∈ (𝑀...𝑁) ∧ 𝜓))
31	17, 30	impbida 604	. . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ (𝑀...𝑁) ∧ 𝜓) ↔ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 ≤ 𝑁 ∧ 𝜓))))
32	31	rabbidva2 2805	. . . . 5 ⊢ (𝜑 → {𝑛 ∈ (𝑀...𝑁) ∣ 𝜓} = {𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)})
33	2, 32	eqtrid 2283	. . . 4 ⊢ (𝜑 → 𝑆 = {𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)})
34	1, 33	eleqtrd 2317	. . 3 ⊢ (𝜑 → 𝐴 ∈ {𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)})
35		elfzelz 10430	. . . . 5 ⊢ (𝑛 ∈ (𝑀...𝐴) → 𝑛 ∈ ℤ)
36		zdcle 9723	. . . . 5 ⊢ ((𝑛 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑛 ≤ 𝑁)
37	35, 23, 36	syl2anr 290	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀...𝐴)) → DECID 𝑛 ≤ 𝑁)
38		infssfzledc.dc	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀...𝐴)) → DECID 𝜓)
39	37, 38	dcand 945	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝑀...𝐴)) → DECID (𝑛 ≤ 𝑁 ∧ 𝜓))
40	10, 11, 34, 39	infssuzcldc 10670	. 2 ⊢ (𝜑 → inf({𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)}, ℝ, < ) ∈ {𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)})
41	33	infeq1d 7352	. 2 ⊢ (𝜑 → inf(𝑆, ℝ, < ) = inf({𝑛 ∈ (ℤ≥‘𝑀) ∣ (𝑛 ≤ 𝑁 ∧ 𝜓)}, ℝ, < ))
42	40, 41, 33	3eltr4d 2322	1 ⊢ (𝜑 → inf(𝑆, ℝ, < ) ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 846   = wceq 1402   ∈ wcel 2209  {crab 2532  [wsbc 3051   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  infcinf 7323  ℝcr 8178   < clt 8360   ≤ cle 8361  ℤcz 9646  ℤ_≥cuz 9923  ...cfz 10413

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9306  df-n0 9566  df-z 9647  df-uz 9924  df-fz 10414  df-fzo 10552

This theorem is used by:  ballotfilemscl  13249