Theorem xrinfmexpnf 12008

Description: Adding plus infinity to a set does not affect the existence of its infimum. (Contributed by NM, 19-Jan-2006.)

Assertion

Ref	Expression
xrinfmexpnf	⊢ (∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)))

Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Proof of Theorem xrinfmexpnf

Step	Hyp	Ref	Expression
1		elun 3715	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 ∪ {+∞}) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ {+∞}))
2		simpr 476	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥))
3		velsn 4141	. . . . . . . . 9 ⊢ (𝑦 ∈ {+∞} ↔ 𝑦 = +∞)
4		pnfnlt 11838	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ* → ¬ +∞ < 𝑥)
5		breq1 4586	. . . . . . . . . . 11 ⊢ (𝑦 = +∞ → (𝑦 < 𝑥 ↔ +∞ < 𝑥))
6	5	notbid 307	. . . . . . . . . 10 ⊢ (𝑦 = +∞ → (¬ 𝑦 < 𝑥 ↔ ¬ +∞ < 𝑥))
7	4, 6	syl5ibrcom 236	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ* → (𝑦 = +∞ → ¬ 𝑦 < 𝑥))
8	3, 7	syl5bi 231	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ* → (𝑦 ∈ {+∞} → ¬ 𝑦 < 𝑥))
9	8	adantr 480	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ {+∞} → ¬ 𝑦 < 𝑥))
10	2, 9	jaod 394	. . . . . 6 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → ((𝑦 ∈ 𝐴 ∨ 𝑦 ∈ {+∞}) → ¬ 𝑦 < 𝑥))
11	1, 10	syl5bi 231	. . . . 5 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ (𝐴 ∪ {+∞}) → ¬ 𝑦 < 𝑥))
12	11	ex 449	. . . 4 ⊢ (𝑥 ∈ ℝ* → ((𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥) → (𝑦 ∈ (𝐴 ∪ {+∞}) → ¬ 𝑦 < 𝑥)))
13	12	ralimdv2 2944	. . 3 ⊢ (𝑥 ∈ ℝ* → (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 → ∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥))
14		elun1 3742	. . . . . . . 8 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ (𝐴 ∪ {+∞}))
15	14	anim1i 590	. . . . . . 7 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑧 < 𝑦) → (𝑧 ∈ (𝐴 ∪ {+∞}) ∧ 𝑧 < 𝑦))
16	15	reximi2 2993	. . . . . 6 ⊢ (∃𝑧 ∈ 𝐴 𝑧 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)
17	16	imim2i 16	. . . . 5 ⊢ ((𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))
18	17	ralimi 2936	. . . 4 ⊢ (∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))
19	18	a1i 11	. . 3 ⊢ (𝑥 ∈ ℝ* → (∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)))
20	13, 19	anim12d 584	. 2 ⊢ (𝑥 ∈ ℝ* → ((∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))))
21	20	reximia 2992	1 ⊢ (∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)))

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 382   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897   ∪ cun 3538  {csn 4125   class class class wbr 4583  +∞cpnf 9950  ℝ^*cxr 9952   < clt 9953

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-xp 5044  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958

This theorem is referenced by:  xrinfmss  12012