ivthdichlem - Intuitionistic Logic Explorer

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

Theorem ivthdichlem 15843

Description: Lemma for ivthdich 15845. The result, with a few notational conveniences. (Contributed by Jim Kingdon, 22-Jul-2025.)

**Hypotheses**
Ref	Expression
hover.f	⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < ))
ivthdichlem.z	⊢ (𝜑 → 𝑍 ∈ ℝ)
ivthdichlem.i	⊢ (𝜑 → ∀𝑓(𝑓 ∈ (ℝ–cn→ℝ) → ∀𝑎 ∈ ℝ ∀𝑏 ∈ ℝ ((𝑎 < 𝑏 ∧ (𝑓‘𝑎) < 0 ∧ 0 < (𝑓‘𝑏)) → ∃𝑥 ∈ ℝ (𝑎 < 𝑥 ∧ 𝑥 < 𝑏 ∧ (𝑓‘𝑥) = 0))))

**Assertion**
Ref	Expression
ivthdichlem	⊢ (𝜑 → (𝑍 ≤ 0 ∨ 0 ≤ 𝑍))

Distinct variable groups: 𝐹,𝑎,𝑏,𝑓,𝑥 𝑍,𝑎,𝑏,𝑓,𝑥 𝜑,𝑥 Allowed substitution hints: 𝜑(𝑓, 𝑎, 𝑏)

Proof of Theorem ivthdichlem Dummy variable 𝑐 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ivthdichlem.z	. . . 4 ⊢ (𝜑 → 𝑍 ∈ ℝ)
2		peano2rem 8595	. . . 4 ⊢ (𝑍 ∈ ℝ → (𝑍 − 1) ∈ ℝ)
3	1, 2	syl 14	. . 3 ⊢ (𝜑 → (𝑍 − 1) ∈ ℝ)
4		2re 9377	. . . . 5 ⊢ 2 ∈ ℝ
5	4	a1i 9	. . . 4 ⊢ (𝜑 → 2 ∈ ℝ)
6	1, 5	readdcld 8356	. . 3 ⊢ (𝜑 → (𝑍 + 2) ∈ ℝ)
7	1	ltm1d 9265	. . . 4 ⊢ (𝜑 → (𝑍 − 1) < 𝑍)
8		2rp 10070	. . . . . 6 ⊢ 2 ∈ ℝ⁺
9	8	a1i 9	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ⁺)
10	1, 9	ltaddrpd 10142	. . . 4 ⊢ (𝜑 → 𝑍 < (𝑍 + 2))
11	3, 1, 6, 7, 10	lttrd 8454	. . 3 ⊢ (𝜑 → (𝑍 − 1) < (𝑍 + 2))
12		hover.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ sup({inf({𝑥, 0}, ℝ, < ), (𝑥 − 1)}, ℝ, < ))
13	12	hovercncf 15838	. . . 4 ⊢ 𝐹 ∈ (ℝ–cn→ℝ)
14	13	a1i 9	. . 3 ⊢ (𝜑 → 𝐹 ∈ (ℝ–cn→ℝ))
15	12	hovera 15839	. . . . 5 ⊢ (𝑍 ∈ ℝ → (𝐹‘(𝑍 − 1)) < 𝑍)
16	1, 15	syl 14	. . . 4 ⊢ (𝜑 → (𝐹‘(𝑍 − 1)) < 𝑍)
17	12	hoverb 15840	. . . . 5 ⊢ (𝑍 ∈ ℝ → 𝑍 < (𝐹‘(𝑍 + 2)))
18	1, 17	syl 14	. . . 4 ⊢ (𝜑 → 𝑍 < (𝐹‘(𝑍 + 2)))
19	16, 18	jca 306	. . 3 ⊢ (𝜑 → ((𝐹‘(𝑍 − 1)) < 𝑍 ∧ 𝑍 < (𝐹‘(𝑍 + 2))))
20		ivthdichlem.i	. . 3 ⊢ (𝜑 → ∀𝑓(𝑓 ∈ (ℝ–cn→ℝ) → ∀𝑎 ∈ ℝ ∀𝑏 ∈ ℝ ((𝑎 < 𝑏 ∧ (𝑓‘𝑎) < 0 ∧ 0 < (𝑓‘𝑏)) → ∃𝑥 ∈ ℝ (𝑎 < 𝑥 ∧ 𝑥 < 𝑏 ∧ (𝑓‘𝑥) = 0))))
21	3, 6, 1, 11, 14, 19, 20	ivthreinc 15837	. 2 ⊢ (𝜑 → ∃𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2))(𝐹‘𝑐) = 𝑍)
22		0red 8328	. . . . 5 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → 0 ∈ ℝ)
23		1red 8342	. . . . 5 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → 1 ∈ ℝ)
24		elioore 10325	. . . . . 6 ⊢ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) → 𝑐 ∈ ℝ)
25	24	ad2antrl 494	. . . . 5 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → 𝑐 ∈ ℝ)
26		0lt1 8455	. . . . . 6 ⊢ 0 < 1
27		axltwlin 8394	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑐 ∈ ℝ) → (0 < 1 → (0 < 𝑐 ∨ 𝑐 < 1)))
28	26, 27	mpi 15	. . . . 5 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑐 ∈ ℝ) → (0 < 𝑐 ∨ 𝑐 < 1))
29	22, 23, 25, 28	syl3anc 1278	. . . 4 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → (0 < 𝑐 ∨ 𝑐 < 1))
30	29	orcomd 741	. . 3 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → (𝑐 < 1 ∨ 0 < 𝑐))
31		simplrr 542	. . . . . 6 ⊢ (((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) ∧ 𝑐 < 1) → (𝐹‘𝑐) = 𝑍)
32	12	hoverlt1 15841	. . . . . . 7 ⊢ ((𝑐 ∈ ℝ ∧ 𝑐 < 1) → (𝐹‘𝑐) ≤ 0)
33	25, 32	sylan 283	. . . . . 6 ⊢ (((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) ∧ 𝑐 < 1) → (𝐹‘𝑐) ≤ 0)
34	31, 33	eqbrtrrd 4154	. . . . 5 ⊢ (((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) ∧ 𝑐 < 1) → 𝑍 ≤ 0)
35	34	ex 115	. . . 4 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → (𝑐 < 1 → 𝑍 ≤ 0))
36	12	hovergt0 15842	. . . . . . 7 ⊢ ((𝑐 ∈ ℝ ∧ 0 < 𝑐) → 0 ≤ (𝐹‘𝑐))
37	25, 36	sylan 283	. . . . . 6 ⊢ (((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) ∧ 0 < 𝑐) → 0 ≤ (𝐹‘𝑐))
38		simplrr 542	. . . . . 6 ⊢ (((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) ∧ 0 < 𝑐) → (𝐹‘𝑐) = 𝑍)
39	37, 38	breqtrd 4156	. . . . 5 ⊢ (((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) ∧ 0 < 𝑐) → 0 ≤ 𝑍)
40	39	ex 115	. . . 4 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → (0 < 𝑐 → 0 ≤ 𝑍))
41	35, 40	orim12d 798	. . 3 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → ((𝑐 < 1 ∨ 0 < 𝑐) → (𝑍 ≤ 0 ∨ 0 ≤ 𝑍)))
42	30, 41	mpd 13	. 2 ⊢ ((𝜑 ∧ (𝑐 ∈ ((𝑍 − 1)(,)(𝑍 + 2)) ∧ (𝐹‘𝑐) = 𝑍)) → (𝑍 ≤ 0 ∨ 0 ≤ 𝑍))
43	21, 42	rexlimddv 2673	1 ⊢ (𝜑 → (𝑍 ≤ 0 ∨ 0 ≤ 𝑍))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∨ wo 720 ∧ w3a 1009 ∀wal 1400 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ∃wrex 2529 {cpr 3710 class class class wbr 4130 ↦ cmpt 4192 ‘cfv 5377 (class class class)co 6085 supcsup 7323 infcinf 7324 ℝcr 8179 0cc0 8180 1c1 8181 + caddc 8183 < clt 8361 ≤ cle 8362 − cmin 8499 2c2 9358 ℝ⁺crp 10065 (,)cioo 10301 –cn→ccncf 15762

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-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300 ax-addf 8302

This proof depends on definitions: df-bi 117 df-stab 843 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-nul 3521 df-if 3639 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-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 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-recs 6576 df-frec 6662 df-map 6924 df-sup 7325 df-inf 7326 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-xneg 10185 df-xadd 10186 df-ioo 10305 df-seqfrec 10900 df-exp 10991 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781 df-rest 13648 df-topgen 13667 df-psmet 14964 df-xmet 14965 df-met 14966 df-bl 14967 df-mopn 14968 df-top 15190 df-topon 15203 df-bases 15235 df-cn 15380 df-cnp 15381 df-tx 15445 df-cncf 15763

This theorem is used by: ivthdich 15845

W3C validator