MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pnfnei Structured version   Visualization version   GIF version

Theorem pnfnei 23348
Description: A neighborhood of +∞ contains an unbounded interval based at a real number. Together with xrtgioo 24935 (which describes neighborhoods of ) and mnfnei 23349, this gives all "negative" topological information ensuring that it is not too fine (and of course iooordt 23345 and similar ensure that it has all the sets we want). (Contributed by Mario Carneiro, 3-Sep-2015.)
Assertion
Ref Expression
pnfnei ((𝐴 ∈ (ordTop‘ ≤ ) ∧ +∞ ∈ 𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem pnfnei
Dummy variables 𝑎 𝑏 𝑐 𝑢 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2769 . . . 4 ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) = ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞))
2 eqid 2769 . . . 4 ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦)) = ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))
3 eqid 2769 . . . 4 ran (,) = ran (,)
41, 2, 3leordtval 23341 . . 3 (ordTop‘ ≤ ) = (topGen‘((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,)))
54eleq2i 2861 . 2 (𝐴 ∈ (ordTop‘ ≤ ) ↔ 𝐴 ∈ (topGen‘((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,))))
6 tg2 23093 . . 3 ((𝐴 ∈ (topGen‘((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,))) ∧ +∞ ∈ 𝐴) → ∃𝑢 ∈ ((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,))(+∞ ∈ 𝑢𝑢𝐴))
7 elun 4115 . . . . 5 (𝑢 ∈ ((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,)) ↔ (𝑢 ∈ (ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∨ 𝑢 ∈ ran (,)))
8 elun 4115 . . . . . . 7 (𝑢 ∈ (ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ↔ (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∨ 𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))))
9 eqid 2769 . . . . . . . . . . 11 (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) = (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞))
109elrnmpt 5951 . . . . . . . . . 10 (𝑢 ∈ V → (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ↔ ∃𝑦 ∈ ℝ* 𝑢 = (𝑦(,]+∞)))
1110elv 3468 . . . . . . . . 9 (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ↔ ∃𝑦 ∈ ℝ* 𝑢 = (𝑦(,]+∞))
12 mnfxr 11268 . . . . . . . . . . . . . 14 -∞ ∈ ℝ*
1312a1i 11 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → -∞ ∈ ℝ*)
14 simprl 782 . . . . . . . . . . . . . 14 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → 𝑦 ∈ ℝ*)
15 0xr 11258 . . . . . . . . . . . . . 14 0 ∈ ℝ*
16 ifcl 4538 . . . . . . . . . . . . . 14 ((𝑦 ∈ ℝ* ∧ 0 ∈ ℝ*) → if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ*)
1714, 15, 16sylancl 597 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ*)
18 pnfxr 11265 . . . . . . . . . . . . . 14 +∞ ∈ ℝ*
1918a1i 11 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → +∞ ∈ ℝ*)
20 xrmax1 13203 . . . . . . . . . . . . . . 15 ((0 ∈ ℝ*𝑦 ∈ ℝ*) → 0 ≤ if(0 ≤ 𝑦, 𝑦, 0))
2115, 14, 20sylancr 598 . . . . . . . . . . . . . 14 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → 0 ≤ if(0 ≤ 𝑦, 𝑦, 0))
22 ge0gtmnf 13200 . . . . . . . . . . . . . 14 ((if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ* ∧ 0 ≤ if(0 ≤ 𝑦, 𝑦, 0)) → -∞ < if(0 ≤ 𝑦, 𝑦, 0))
2317, 21, 22syl2anc 595 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → -∞ < if(0 ≤ 𝑦, 𝑦, 0))
24 simpll 778 . . . . . . . . . . . . . . . . 17 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → +∞ ∈ 𝑢)
25 simprr 784 . . . . . . . . . . . . . . . . 17 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → 𝑢 = (𝑦(,]+∞))
2624, 25eleqtrd 2871 . . . . . . . . . . . . . . . 16 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → +∞ ∈ (𝑦(,]+∞))
27 elioc1 13416 . . . . . . . . . . . . . . . . 17 ((𝑦 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (+∞ ∈ (𝑦(,]+∞) ↔ (+∞ ∈ ℝ*𝑦 < +∞ ∧ +∞ ≤ +∞)))
2814, 18, 27sylancl 597 . . . . . . . . . . . . . . . 16 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → (+∞ ∈ (𝑦(,]+∞) ↔ (+∞ ∈ ℝ*𝑦 < +∞ ∧ +∞ ≤ +∞)))
2926, 28mpbid 235 . . . . . . . . . . . . . . 15 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → (+∞ ∈ ℝ*𝑦 < +∞ ∧ +∞ ≤ +∞))
3029simp2d 1159 . . . . . . . . . . . . . 14 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → 𝑦 < +∞)
31 0ltpnf 13149 . . . . . . . . . . . . . 14 0 < +∞
32 breq1 5116 . . . . . . . . . . . . . . 15 (𝑦 = if(0 ≤ 𝑦, 𝑦, 0) → (𝑦 < +∞ ↔ if(0 ≤ 𝑦, 𝑦, 0) < +∞))
33 breq1 5116 . . . . . . . . . . . . . . 15 (0 = if(0 ≤ 𝑦, 𝑦, 0) → (0 < +∞ ↔ if(0 ≤ 𝑦, 𝑦, 0) < +∞))
3432, 33ifboth 4532 . . . . . . . . . . . . . 14 ((𝑦 < +∞ ∧ 0 < +∞) → if(0 ≤ 𝑦, 𝑦, 0) < +∞)
3530, 31, 34sylancl 597 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → if(0 ≤ 𝑦, 𝑦, 0) < +∞)
36 xrre2 13198 . . . . . . . . . . . . 13 (((-∞ ∈ ℝ* ∧ if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ* ∧ +∞ ∈ ℝ*) ∧ (-∞ < if(0 ≤ 𝑦, 𝑦, 0) ∧ if(0 ≤ 𝑦, 𝑦, 0) < +∞)) → if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ)
3713, 17, 19, 23, 35, 36syl32anc 1403 . . . . . . . . . . . 12 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ)
38 xrmax2 13204 . . . . . . . . . . . . . . 15 ((0 ∈ ℝ*𝑦 ∈ ℝ*) → 𝑦 ≤ if(0 ≤ 𝑦, 𝑦, 0))
3915, 14, 38sylancr 598 . . . . . . . . . . . . . 14 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → 𝑦 ≤ if(0 ≤ 𝑦, 𝑦, 0))
40 df-ioc 13379 . . . . . . . . . . . . . . 15 (,] = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑐 ∈ ℝ* ∣ (𝑎 < 𝑐𝑐𝑏)})
41 xrlelttr 13183 . . . . . . . . . . . . . . 15 ((𝑦 ∈ ℝ* ∧ if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ*𝑥 ∈ ℝ*) → ((𝑦 ≤ if(0 ≤ 𝑦, 𝑦, 0) ∧ if(0 ≤ 𝑦, 𝑦, 0) < 𝑥) → 𝑦 < 𝑥))
4240, 40, 41ixxss1 13392 . . . . . . . . . . . . . 14 ((𝑦 ∈ ℝ*𝑦 ≤ if(0 ≤ 𝑦, 𝑦, 0)) → (if(0 ≤ 𝑦, 𝑦, 0)(,]+∞) ⊆ (𝑦(,]+∞))
4314, 39, 42syl2anc 595 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → (if(0 ≤ 𝑦, 𝑦, 0)(,]+∞) ⊆ (𝑦(,]+∞))
44 simplr 780 . . . . . . . . . . . . . 14 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → 𝑢𝐴)
4525, 44eqsstrrd 3980 . . . . . . . . . . . . 13 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → (𝑦(,]+∞) ⊆ 𝐴)
4643, 45sstrd 3955 . . . . . . . . . . . 12 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → (if(0 ≤ 𝑦, 𝑦, 0)(,]+∞) ⊆ 𝐴)
47 oveq1 7420 . . . . . . . . . . . . . 14 (𝑥 = if(0 ≤ 𝑦, 𝑦, 0) → (𝑥(,]+∞) = (if(0 ≤ 𝑦, 𝑦, 0)(,]+∞))
4847sseq1d 3976 . . . . . . . . . . . . 13 (𝑥 = if(0 ≤ 𝑦, 𝑦, 0) → ((𝑥(,]+∞) ⊆ 𝐴 ↔ (if(0 ≤ 𝑦, 𝑦, 0)(,]+∞) ⊆ 𝐴))
4948rspcev 3590 . . . . . . . . . . . 12 ((if(0 ≤ 𝑦, 𝑦, 0) ∈ ℝ ∧ (if(0 ≤ 𝑦, 𝑦, 0)(,]+∞) ⊆ 𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴)
5037, 46, 49syl2anc 595 . . . . . . . . . . 11 (((+∞ ∈ 𝑢𝑢𝐴) ∧ (𝑦 ∈ ℝ*𝑢 = (𝑦(,]+∞))) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴)
5150rexlimdvaa 3173 . . . . . . . . . 10 ((+∞ ∈ 𝑢𝑢𝐴) → (∃𝑦 ∈ ℝ* 𝑢 = (𝑦(,]+∞) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
5251com12 33 . . . . . . . . 9 (∃𝑦 ∈ ℝ* 𝑢 = (𝑦(,]+∞) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
5311, 52sylbi 220 . . . . . . . 8 (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
54 eqid 2769 . . . . . . . . . . 11 (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦)) = (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))
5554elrnmpt 5951 . . . . . . . . . 10 (𝑢 ∈ V → (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦)) ↔ ∃𝑦 ∈ ℝ* 𝑢 = (-∞[,)𝑦)))
5655elv 3468 . . . . . . . . 9 (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦)) ↔ ∃𝑦 ∈ ℝ* 𝑢 = (-∞[,)𝑦))
57 pnfnlt 13155 . . . . . . . . . . . . . 14 (𝑦 ∈ ℝ* → ¬ +∞ < 𝑦)
58 elico1 13417 . . . . . . . . . . . . . . . 16 ((-∞ ∈ ℝ*𝑦 ∈ ℝ*) → (+∞ ∈ (-∞[,)𝑦) ↔ (+∞ ∈ ℝ* ∧ -∞ ≤ +∞ ∧ +∞ < 𝑦)))
5912, 58mpan 702 . . . . . . . . . . . . . . 15 (𝑦 ∈ ℝ* → (+∞ ∈ (-∞[,)𝑦) ↔ (+∞ ∈ ℝ* ∧ -∞ ≤ +∞ ∧ +∞ < 𝑦)))
60 simp3 1154 . . . . . . . . . . . . . . 15 ((+∞ ∈ ℝ* ∧ -∞ ≤ +∞ ∧ +∞ < 𝑦) → +∞ < 𝑦)
6159, 60biimtrdi 256 . . . . . . . . . . . . . 14 (𝑦 ∈ ℝ* → (+∞ ∈ (-∞[,)𝑦) → +∞ < 𝑦))
6257, 61mtod 201 . . . . . . . . . . . . 13 (𝑦 ∈ ℝ* → ¬ +∞ ∈ (-∞[,)𝑦))
63 eleq2 2858 . . . . . . . . . . . . . 14 (𝑢 = (-∞[,)𝑦) → (+∞ ∈ 𝑢 ↔ +∞ ∈ (-∞[,)𝑦)))
6463notbid 321 . . . . . . . . . . . . 13 (𝑢 = (-∞[,)𝑦) → (¬ +∞ ∈ 𝑢 ↔ ¬ +∞ ∈ (-∞[,)𝑦)))
6562, 64syl5ibrcom 250 . . . . . . . . . . . 12 (𝑦 ∈ ℝ* → (𝑢 = (-∞[,)𝑦) → ¬ +∞ ∈ 𝑢))
6665rexlimiv 3165 . . . . . . . . . . 11 (∃𝑦 ∈ ℝ* 𝑢 = (-∞[,)𝑦) → ¬ +∞ ∈ 𝑢)
6766pm2.21d 122 . . . . . . . . . 10 (∃𝑦 ∈ ℝ* 𝑢 = (-∞[,)𝑦) → (+∞ ∈ 𝑢 → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
6867adantrd 496 . . . . . . . . 9 (∃𝑦 ∈ ℝ* 𝑢 = (-∞[,)𝑦) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
6956, 68sylbi 220 . . . . . . . 8 (𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦)) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
7053, 69jaoi 870 . . . . . . 7 ((𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∨ 𝑢 ∈ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
718, 70sylbi 220 . . . . . 6 (𝑢 ∈ (ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
72 pnfnre 11252 . . . . . . . . . 10 +∞ ∉ ℝ
7372neli 3072 . . . . . . . . 9 ¬ +∞ ∈ ℝ
74 elssuni 4908 . . . . . . . . . . 11 (𝑢 ∈ ran (,) → 𝑢 ran (,))
75 unirnioo 13478 . . . . . . . . . . 11 ℝ = ran (,)
7674, 75sseqtrrdi 3986 . . . . . . . . . 10 (𝑢 ∈ ran (,) → 𝑢 ⊆ ℝ)
7776sseld 3944 . . . . . . . . 9 (𝑢 ∈ ran (,) → (+∞ ∈ 𝑢 → +∞ ∈ ℝ))
7873, 77mtoi 202 . . . . . . . 8 (𝑢 ∈ ran (,) → ¬ +∞ ∈ 𝑢)
7978pm2.21d 122 . . . . . . 7 (𝑢 ∈ ran (,) → (+∞ ∈ 𝑢 → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
8079adantrd 496 . . . . . 6 (𝑢 ∈ ran (,) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
8171, 80jaoi 870 . . . . 5 ((𝑢 ∈ (ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∨ 𝑢 ∈ ran (,)) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
827, 81sylbi 220 . . . 4 (𝑢 ∈ ((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,)) → ((+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴))
8382rexlimiv 3165 . . 3 (∃𝑢 ∈ ((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,))(+∞ ∈ 𝑢𝑢𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴)
846, 83syl 18 . 2 ((𝐴 ∈ (topGen‘((ran (𝑦 ∈ ℝ* ↦ (𝑦(,]+∞)) ∪ ran (𝑦 ∈ ℝ* ↦ (-∞[,)𝑦))) ∪ ran (,))) ∧ +∞ ∈ 𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴)
855, 84sylanb 592 1 ((𝐴 ∈ (ordTop‘ ≤ ) ∧ +∞ ∈ 𝐴) → ∃𝑥 ∈ ℝ (𝑥(,]+∞) ⊆ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  wo 860  w3a 1101   = wceq 1567  wcel 2149  wrex 3095  Vcvv 3463  cun 3911  wss 3913  ifcif 4492   cuni 4876   class class class wbr 5113  cmpt 5196  ran crn 5665  cfv 6539  (class class class)co 7413  cr 11101  0cc0 11102  +∞cpnf 11242  -∞cmnf 11243  *cxr 11244   < clt 11245  cle 11246  (,)cioo 13374  (,]cioc 13375  [,)cico 13376  topGenctg 17492  ordTopcordt 17555
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5273  ax-pow 5339  ax-pr 5407  ax-un 7735  ax-cnex 11158  ax-resscn 11159  ax-1cn 11160  ax-icn 11161  ax-addcl 11162  ax-addrcl 11163  ax-mulcl 11164  ax-mulrcl 11165  ax-mulcom 11166  ax-addass 11167  ax-mulass 11168  ax-distr 11169  ax-i2m1 11170  ax-1ne0 11171  ax-1rid 11172  ax-rnegex 11173  ax-rrecex 11174  ax-cnre 11175  ax-pre-lttri 11176  ax-pre-lttrn 11177  ax-pre-ltadd 11178  ax-pre-mulgt0 11179
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5559  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7865  df-1st 7988  df-2nd 7989  df-1o 8455  df-2o 8456  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-fi 9373  df-pnf 11247  df-mnf 11248  df-xr 11249  df-ltxr 11250  df-le 11251  df-sub 11445  df-neg 11446  df-ioo 13378  df-ioc 13379  df-ico 13380  df-icc 13381  df-topgen 17498  df-ordt 17557  df-ps 18624  df-tsr 18625  df-top 23022  df-bases 23074
This theorem is referenced by:  xrge0tsms  24963  xrlimcnp  27101  xrge0tsmsd  33336  pnfneige0  34288  xlimpnfvlem2  46480
  Copyright terms: Public domain W3C validator