Theorem dfinfre 12199

Description: The infimum of a set of reals 𝐴. (Contributed by NM, 9-Oct-2005.) (Revised by AV, 4-Sep-2020.)

Assertion

Ref	Expression
dfinfre	⊢ (𝐴 ⊆ ℝ → inf(𝐴, ℝ, < ) = ∪ {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))})

Distinct variable group:   𝑥,𝐴,𝑦,𝑧

Proof of Theorem dfinfre

Step	Hyp	Ref	Expression
1		df-inf 9440	. 2 ⊢ inf(𝐴, ℝ, < ) = sup(𝐴, ℝ, ◡ < )
2		df-sup 9439	. . 3 ⊢ sup(𝐴, ℝ, ◡ < ) = ∪ {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥◡ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧))}
3		ssel2 3977	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ)
4		vex 3478	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
5		vex 3478	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
6	4, 5	brcnv 5882	. . . . . . . . . . . 12 ⊢ (𝑥◡ < 𝑦 ↔ 𝑦 < 𝑥)
7	6	notbii 319	. . . . . . . . . . 11 ⊢ (¬ 𝑥◡ < 𝑦 ↔ ¬ 𝑦 < 𝑥)
8		lenlt 11296	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 ≤ 𝑦 ↔ ¬ 𝑦 < 𝑥))
9	7, 8	bitr4id 289	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (¬ 𝑥◡ < 𝑦 ↔ 𝑥 ≤ 𝑦))
10	3, 9	sylan2 593	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ (𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴)) → (¬ 𝑥◡ < 𝑦 ↔ 𝑥 ≤ 𝑦))
11	10	ancoms 459	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ 𝑥◡ < 𝑦 ↔ 𝑥 ≤ 𝑦))
12	11	an32s 650	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → (¬ 𝑥◡ < 𝑦 ↔ 𝑥 ≤ 𝑦))
13	12	ralbidva 3175	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝐴 ¬ 𝑥◡ < 𝑦 ↔ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦))
14	5, 4	brcnv 5882	. . . . . . . . 9 ⊢ (𝑦◡ < 𝑥 ↔ 𝑥 < 𝑦)
15		vex 3478	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
16	5, 15	brcnv 5882	. . . . . . . . . 10 ⊢ (𝑦◡ < 𝑧 ↔ 𝑧 < 𝑦)
17	16	rexbii 3094	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧 ↔ ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)
18	14, 17	imbi12i 350	. . . . . . . 8 ⊢ ((𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧) ↔ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))
19	18	ralbii 3093	. . . . . . 7 ⊢ (∀𝑦 ∈ ℝ (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧) ↔ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))
20	19	a1i 11	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ ℝ (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧) ↔ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)))
21	13, 20	anbi12d 631	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → ((∀𝑦 ∈ 𝐴 ¬ 𝑥◡ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧)) ↔ (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))))
22	21	rabbidva 3439	. . . 4 ⊢ (𝐴 ⊆ ℝ → {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥◡ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧))} = {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))})
23	22	unieqd 4922	. . 3 ⊢ (𝐴 ⊆ ℝ → ∪ {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥◡ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦◡ < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦◡ < 𝑧))} = ∪ {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))})
24	2, 23	eqtrid 2784	. 2 ⊢ (𝐴 ⊆ ℝ → sup(𝐴, ℝ, ◡ < ) = ∪ {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))})
25	1, 24	eqtrid 2784	1 ⊢ (𝐴 ⊆ ℝ → inf(𝐴, ℝ, < ) = ∪ {𝑥 ∈ ℝ ∣ (∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦))})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070  {crab 3432   ⊆ wss 3948  ∪ cuni 4908   class class class wbr 5148  ^◡ccnv 5675  supcsup 9437  infcinf 9438  ℝcr 11111   < clt 11252   ≤ cle 11253

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-xp 5682  df-cnv 5684  df-sup 9439  df-inf 9440  df-xr 11256  df-le 11258

This theorem is referenced by: (None)