Theorem xrinfmexpnf 13350

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 490	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥))
3		velsn 4607	. . . . . . . . 9 ⊢ (𝑦 ∈ {+∞} ↔ 𝑦 = +∞)
4		pnfnlt 13171	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ* → ¬ +∞ < 𝑥)
5		breq1 5114	. . . . . . . . . . 11 ⊢ (𝑦 = +∞ → (𝑦 < 𝑥 ↔ +∞ < 𝑥))
6	5	notbid 321	. . . . . . . . . 10 ⊢ (𝑦 = +∞ → (¬ 𝑦 < 𝑥 ↔ ¬ +∞ < 𝑥))
7	4, 6	syl5ibrcom 250	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ* → (𝑦 = +∞ → ¬ 𝑦 < 𝑥))
8	3, 7	biimtrid 245	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ* → (𝑦 ∈ {+∞} → ¬ 𝑦 < 𝑥))
9	8	adantr 486	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ {+∞} → ¬ 𝑦 < 𝑥))
10	2, 9	jaod 873	. . . . . 6 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → ((𝑦 ∈ 𝐴 ∨ 𝑦 ∈ {+∞}) → ¬ 𝑦 < 𝑥))
11	1, 10	biimtrid 245	. . . . 5 ⊢ ((𝑥 ∈ ℝ* ∧ (𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥)) → (𝑦 ∈ (𝐴 ∪ {+∞}) → ¬ 𝑦 < 𝑥))
12	11	ex 418	. . . 4 ⊢ (𝑥 ∈ ℝ* → ((𝑦 ∈ 𝐴 → ¬ 𝑦 < 𝑥) → (𝑦 ∈ (𝐴 ∪ {+∞}) → ¬ 𝑦 < 𝑥)))
13	12	ralimdv2 3176	. . 3 ⊢ (𝑥 ∈ ℝ* → (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 → ∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥))
14		elun1 4135	. . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ (𝐴 ∪ {+∞}))
15	14	anim1i 627	. . . . . 6 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑧 < 𝑦) → (𝑧 ∈ (𝐴 ∪ {+∞}) ∧ 𝑧 < 𝑦))
16	15	reximi2 3100	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 𝑧 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)
17	16	imim2i 17	. . . 4 ⊢ ((𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))
18	17	ralimi 3104	. . 3 ⊢ (∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))
19	13, 18	anim12d1 622	. 2 ⊢ (𝑥 ∈ ℝ* → ((∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦))))
20	19	reximia 3102	1 ⊢ (∃𝑥 ∈ ℝ* (∀𝑦 ∈ 𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ 𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ ℝ* (∀𝑦 ∈ (𝐴 ∪ {+∞}) ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ ℝ* (𝑥 < 𝑦 → ∃𝑧 ∈ (𝐴 ∪ {+∞})𝑧 < 𝑦)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091   ∪ cun 3904  {csn 4591   class class class wbr 5111  +∞cpnf 11257  ℝ^*cxr 11259   < clt 11260

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11173  ax-resscn 11174

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-pnf 11262  df-mnf 11263  df-xr 11264  df-ltxr 11265

This theorem is used by:  xrinfmss  13354