Theorem infregelbex 9598

Description: Any lower bound of a set of real numbers with an infimum is less than or equal to the infimum. (Contributed by Jim Kingdon, 27-Sep-2024.)

Hypotheses

Ref	Expression
infregelbex.ex	⊢ (𝜑 → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)))
infregelbex.ss	⊢ (𝜑 → 𝐴 ⊆ ℝ)
infregelbex.b	⊢ (𝜑 → 𝐵 ∈ ℝ)

Assertion

Ref	Expression
infregelbex	⊢ (𝜑 → (𝐵 ≤ inf(𝐴, ℝ, < ) ↔ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧))

Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Proof of Theorem infregelbex

Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		infregelbex.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ)
2	1	ad2antrr 488	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) ∧ 𝑎 ∈ 𝐴) → 𝐵 ∈ ℝ)
3		lttri3 8037	. . . . . . . 8 ⊢ ((𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → (𝑏 = 𝑐 ↔ (¬ 𝑏 < 𝑐 ∧ ¬ 𝑐 < 𝑏)))
4	3	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ)) → (𝑏 = 𝑐 ↔ (¬ 𝑏 < 𝑐 ∧ ¬ 𝑐 < 𝑏)))
5		infregelbex.ex	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)))
6	4, 5	infclti 7022	. . . . . 6 ⊢ (𝜑 → inf(𝐴, ℝ, < ) ∈ ℝ)
7	6	ad2antrr 488	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) ∧ 𝑎 ∈ 𝐴) → inf(𝐴, ℝ, < ) ∈ ℝ)
8		infregelbex.ss	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
9	8	sselda 3156	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℝ)
10	9	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℝ)
11		simplr 528	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) ∧ 𝑎 ∈ 𝐴) → 𝐵 ≤ inf(𝐴, ℝ, < ))
12	6	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → inf(𝐴, ℝ, < ) ∈ ℝ)
13	4, 5	inflbti 7023	. . . . . . . 8 ⊢ (𝜑 → (𝑎 ∈ 𝐴 → ¬ 𝑎 < inf(𝐴, ℝ, < )))
14	13	imp 124	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ¬ 𝑎 < inf(𝐴, ℝ, < ))
15	12, 9, 14	nltled 8078	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → inf(𝐴, ℝ, < ) ≤ 𝑎)
16	15	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) ∧ 𝑎 ∈ 𝐴) → inf(𝐴, ℝ, < ) ≤ 𝑎)
17	2, 7, 10, 11, 16	letrd 8081	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) ∧ 𝑎 ∈ 𝐴) → 𝐵 ≤ 𝑎)
18	17	ralrimiva 2550	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) → ∀𝑎 ∈ 𝐴 𝐵 ≤ 𝑎)
19		breq2 4008	. . . 4 ⊢ (𝑎 = 𝑧 → (𝐵 ≤ 𝑎 ↔ 𝐵 ≤ 𝑧))
20	19	cbvralv 2704	. . 3 ⊢ (∀𝑎 ∈ 𝐴 𝐵 ≤ 𝑎 ↔ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧)
21	18, 20	sylib 122	. 2 ⊢ ((𝜑 ∧ 𝐵 ≤ inf(𝐴, ℝ, < )) → ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧)
22	1	adantr 276	. . 3 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → 𝐵 ∈ ℝ)
23	6	adantr 276	. . 3 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → inf(𝐴, ℝ, < ) ∈ ℝ)
24		simpl 109	. . . 4 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → 𝜑)
25		simpr 110	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧)
26		breq2 4008	. . . . . . . . 9 ⊢ (𝑧 = 𝑑 → (𝐵 ≤ 𝑧 ↔ 𝐵 ≤ 𝑑))
27	26	cbvralv 2704	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧 ↔ ∀𝑑 ∈ 𝐴 𝐵 ≤ 𝑑)
28	25, 27	sylib 122	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → ∀𝑑 ∈ 𝐴 𝐵 ≤ 𝑑)
29	1	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) ∧ 𝑑 ∈ 𝐴) → 𝐵 ∈ ℝ)
30	8	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) ∧ 𝑑 ∈ 𝐴) → 𝐴 ⊆ ℝ)
31		simpr 110	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) ∧ 𝑑 ∈ 𝐴) → 𝑑 ∈ 𝐴)
32	30, 31	sseldd 3157	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) ∧ 𝑑 ∈ 𝐴) → 𝑑 ∈ ℝ)
33	29, 32	lenltd 8075	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) ∧ 𝑑 ∈ 𝐴) → (𝐵 ≤ 𝑑 ↔ ¬ 𝑑 < 𝐵))
34	33	ralbidva 2473	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → (∀𝑑 ∈ 𝐴 𝐵 ≤ 𝑑 ↔ ∀𝑑 ∈ 𝐴 ¬ 𝑑 < 𝐵))
35	28, 34	mpbid 147	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → ∀𝑑 ∈ 𝐴 ¬ 𝑑 < 𝐵)
36		breq1 4007	. . . . . . . 8 ⊢ (𝑑 = 𝑧 → (𝑑 < 𝐵 ↔ 𝑧 < 𝐵))
37	36	notbid 667	. . . . . . 7 ⊢ (𝑑 = 𝑧 → (¬ 𝑑 < 𝐵 ↔ ¬ 𝑧 < 𝐵))
38	37	cbvralv 2704	. . . . . 6 ⊢ (∀𝑑 ∈ 𝐴 ¬ 𝑑 < 𝐵 ↔ ∀𝑧 ∈ 𝐴 ¬ 𝑧 < 𝐵)
39	35, 38	sylib 122	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → ∀𝑧 ∈ 𝐴 ¬ 𝑧 < 𝐵)
40	22, 39	jca 306	. . . 4 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → (𝐵 ∈ ℝ ∧ ∀𝑧 ∈ 𝐴 ¬ 𝑧 < 𝐵))
41	4, 5	infnlbti 7025	. . . 4 ⊢ (𝜑 → ((𝐵 ∈ ℝ ∧ ∀𝑧 ∈ 𝐴 ¬ 𝑧 < 𝐵) → ¬ inf(𝐴, ℝ, < ) < 𝐵))
42	24, 40, 41	sylc 62	. . 3 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → ¬ inf(𝐴, ℝ, < ) < 𝐵)
43	22, 23, 42	nltled 8078	. 2 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧) → 𝐵 ≤ inf(𝐴, ℝ, < ))
44	21, 43	impbida 596	1 ⊢ (𝜑 → (𝐵 ≤ inf(𝐴, ℝ, < ) ↔ ∀𝑧 ∈ 𝐴 𝐵 ≤ 𝑧))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456   ⊆ wss 3130   class class class wbr 4004  infcinf 6982  ℝcr 7810   < clt 7992   ≤ cle 7993

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-cnex 7902  ax-resscn 7903  ax-pre-ltirr 7923  ax-pre-ltwlin 7924  ax-pre-apti 7926

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2740  df-sbc 2964  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-br 4005  df-opab 4066  df-xp 4633  df-cnv 4635  df-iota 5179  df-riota 5831  df-sup 6983  df-inf 6984  df-pnf 7994  df-mnf 7995  df-xr 7996  df-ltxr 7997  df-le 7998

This theorem is referenced by:  nninfdclemp1  12451