Theorem xrinfmexpnf 13327

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 4107	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 ∪ {+∞}) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ {+∞}))
2		simpr 489	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥))
3		velsn 4605	. . . . . . . . 9 ⊢ (𝑦 ∈ {+∞} ↔ 𝑦 = +∞)
4		pnfnlt 13148	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ* → ¬ +∞ < 𝑥)
5		breq1 5112	. . . . . . . . . . 11 ⊢ (𝑦 = +∞ → (𝑦 < 𝑥 ↔ +∞ < 𝑥))
6	5	notbid 321	. . . . . . . . . 10 ⊢ (𝑦 = +∞ → (¬ 𝑦 < 𝑥 ↔ ¬ +∞ < 𝑥))
7	4, 6	syl5ibrcom 250	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ* → (𝑦 = +∞ → ¬ 𝑦 < 𝑥))
8	3, 7	biimtrid 245	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ* → (𝑦 ∈ {+∞} → ¬ 𝑦 < 𝑥))
9	8	adantr 485	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ {+∞} → ¬ 𝑦 < 𝑥))
10	2, 9	jaod 872	. . . . . 6 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → ((𝑦 ∈ 𝐴 ∨ 𝑦 ∈ {+∞}) → ¬ 𝑦 < 𝑥))
11	1, 10	biimtrid 245	. . . . 5 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ (𝐴 ∪ {+∞}) → ¬ 𝑦 < 𝑥))
12	11	ex 417	. . . 4 ⊢ (𝑥 ∈ ℝ* → ((𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥) → (𝑦 ∈ (𝐴 ∪ {+∞}) → ¬ 𝑦 < 𝑥)))
13	12	ralimdv2 3174	. . 3 ⊢ (𝑥 ∈ ℝ* → (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 → ∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥))
14		elun1 4135	. . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ (𝐴 ∪ {+∞}))
15	14	anim1i 626	. . . . . 6 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑧 < 𝑦) → (𝑧 ∈ (𝐴 ∪ {+∞}) ∧ 𝑧 < 𝑦))
16	15	reximi2 3098	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 𝑧 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)
17	16	imim2i 17	. . . 4 ⊢ ((𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))
18	17	ralimi 3102	. . 3 ⊢ (∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))
19	13, 18	anim12d1 621	. 2 ⊢ (𝑥 ∈ ℝ* → ((∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))))
20	19	reximia 3100	1 ⊢ (∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ∪ cun 3903  {csn 4589   class class class wbr 5109  +∞cpnf 11235  ℝ^*cxr 11237   < clt 11238

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-xp 5667  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243

This theorem is referenced by:  xrinfmss  13331