Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  xrge0infss Structured version   Visualization version   GIF version

Theorem xrge0infss 31665
Description: Any subset of nonnegative extended reals has an infimum. (Contributed by Thierry Arnoux, 16-Sep-2019.) (Revised by AV, 4-Oct-2020.)
Assertion
Ref Expression
xrge0infss (𝐴 ⊆ (0[,]+∞) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Proof of Theorem xrge0infss
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ssel2 3939 . . . . . . 7 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑦𝐴) → 𝑦 ∈ (0[,]+∞))
2 0xr 11202 . . . . . . . . 9 0 ∈ ℝ*
3 pnfxr 11209 . . . . . . . . 9 +∞ ∈ ℝ*
4 iccgelb 13320 . . . . . . . . 9 ((0 ∈ ℝ* ∧ +∞ ∈ ℝ*𝑦 ∈ (0[,]+∞)) → 0 ≤ 𝑦)
52, 3, 4mp3an12 1451 . . . . . . . 8 (𝑦 ∈ (0[,]+∞) → 0 ≤ 𝑦)
6 eliccxr 13352 . . . . . . . . 9 (𝑦 ∈ (0[,]+∞) → 𝑦 ∈ ℝ*)
7 xrlenlt 11220 . . . . . . . . 9 ((0 ∈ ℝ*𝑦 ∈ ℝ*) → (0 ≤ 𝑦 ↔ ¬ 𝑦 < 0))
82, 6, 7sylancr 587 . . . . . . . 8 (𝑦 ∈ (0[,]+∞) → (0 ≤ 𝑦 ↔ ¬ 𝑦 < 0))
95, 8mpbid 231 . . . . . . 7 (𝑦 ∈ (0[,]+∞) → ¬ 𝑦 < 0)
101, 9syl 17 . . . . . 6 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑦𝐴) → ¬ 𝑦 < 0)
1110ralrimiva 3143 . . . . 5 (𝐴 ⊆ (0[,]+∞) → ∀𝑦𝐴 ¬ 𝑦 < 0)
1211ad3antrrr 728 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∀𝑦𝐴 ¬ 𝑦 < 0)
13 iccssxr 13347 . . . . . . . . . 10 (0[,]+∞) ⊆ ℝ*
14 ssralv 4010 . . . . . . . . . 10 ((0[,]+∞) ⊆ ℝ* → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
1513, 14ax-mp 5 . . . . . . . . 9 (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
16 simplll 773 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 ∈ ℝ*)
172a1i 11 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 0 ∈ ℝ*)
18 simplr 767 . . . . . . . . . . . . . 14 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑦 ∈ (0[,]+∞))
1913, 18sselid 3942 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑦 ∈ ℝ*)
20 simpllr 774 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 ≤ 0)
21 simpr 485 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 0 < 𝑦)
2216, 17, 19, 20, 21xrlelttrd 13079 . . . . . . . . . . . 12 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 < 𝑦)
2322ex 413 . . . . . . . . . . 11 (((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) → (0 < 𝑦𝑤 < 𝑦))
2423imim1d 82 . . . . . . . . . 10 (((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) → ((𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → (0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2524ralimdva 3164 . . . . . . . . 9 ((𝑤 ∈ ℝ*𝑤 ≤ 0) → (∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2615, 25syl5 34 . . . . . . . 8 ((𝑤 ∈ ℝ*𝑤 ≤ 0) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2726adantll 712 . . . . . . 7 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2827imp 407 . . . . . 6 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
2928adantrl 714 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
3029an32s 650 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
31 0e0iccpnf 13376 . . . . 5 0 ∈ (0[,]+∞)
32 breq2 5109 . . . . . . . . 9 (𝑥 = 0 → (𝑦 < 𝑥𝑦 < 0))
3332notbid 317 . . . . . . . 8 (𝑥 = 0 → (¬ 𝑦 < 𝑥 ↔ ¬ 𝑦 < 0))
3433ralbidv 3174 . . . . . . 7 (𝑥 = 0 → (∀𝑦𝐴 ¬ 𝑦 < 𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦 < 0))
35 breq1 5108 . . . . . . . . 9 (𝑥 = 0 → (𝑥 < 𝑦 ↔ 0 < 𝑦))
3635imbi1d 341 . . . . . . . 8 (𝑥 = 0 → ((𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ (0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
3736ralbidv 3174 . . . . . . 7 (𝑥 = 0 → (∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
3834, 37anbi12d 631 . . . . . 6 (𝑥 = 0 → ((∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) ↔ (∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
3938rspcev 3581 . . . . 5 ((0 ∈ (0[,]+∞) ∧ (∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4031, 39mpan 688 . . . 4 ((∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4112, 30, 40syl2anc 584 . . 3 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
42 simpllr 774 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 𝑤 ∈ ℝ*)
43 simpr 485 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 0 ≤ 𝑤)
44 elxrge0 13374 . . . . 5 (𝑤 ∈ (0[,]+∞) ↔ (𝑤 ∈ ℝ* ∧ 0 ≤ 𝑤))
4542, 43, 44sylanbrc 583 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 𝑤 ∈ (0[,]+∞))
4615a1i 11 . . . . . . . 8 (𝐴 ⊆ (0[,]+∞) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4746anim2d 612 . . . . . . 7 (𝐴 ⊆ (0[,]+∞) → ((∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
4847adantr 481 . . . . . 6 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) → ((∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
4948imp 407 . . . . 5 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5049adantr 481 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
51 breq2 5109 . . . . . . . 8 (𝑥 = 𝑤 → (𝑦 < 𝑥𝑦 < 𝑤))
5251notbid 317 . . . . . . 7 (𝑥 = 𝑤 → (¬ 𝑦 < 𝑥 ↔ ¬ 𝑦 < 𝑤))
5352ralbidv 3174 . . . . . 6 (𝑥 = 𝑤 → (∀𝑦𝐴 ¬ 𝑦 < 𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦 < 𝑤))
54 breq1 5108 . . . . . . . 8 (𝑥 = 𝑤 → (𝑥 < 𝑦𝑤 < 𝑦))
5554imbi1d 341 . . . . . . 7 (𝑥 = 𝑤 → ((𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5655ralbidv 3174 . . . . . 6 (𝑥 = 𝑤 → (∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5753, 56anbi12d 631 . . . . 5 (𝑥 = 𝑤 → ((∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) ↔ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
5857rspcev 3581 . . . 4 ((𝑤 ∈ (0[,]+∞) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5945, 50, 58syl2anc 584 . . 3 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
60 simplr 767 . . . 4 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → 𝑤 ∈ ℝ*)
612a1i 11 . . . 4 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → 0 ∈ ℝ*)
62 xrletri 13072 . . . 4 ((𝑤 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝑤 ≤ 0 ∨ 0 ≤ 𝑤))
6360, 61, 62syl2anc 584 . . 3 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → (𝑤 ≤ 0 ∨ 0 ≤ 𝑤))
6441, 59, 63mpjaodan 957 . 2 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
65 sstr 3952 . . . 4 ((𝐴 ⊆ (0[,]+∞) ∧ (0[,]+∞) ⊆ ℝ*) → 𝐴 ⊆ ℝ*)
6613, 65mpan2 689 . . 3 (𝐴 ⊆ (0[,]+∞) → 𝐴 ⊆ ℝ*)
67 xrinfmss 13229 . . 3 (𝐴 ⊆ ℝ* → ∃𝑤 ∈ ℝ* (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
6866, 67syl 17 . 2 (𝐴 ⊆ (0[,]+∞) → ∃𝑤 ∈ ℝ* (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
6964, 68r19.29a 3159 1 (𝐴 ⊆ (0[,]+∞) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  wo 845   = wceq 1541  wcel 2106  wral 3064  wrex 3073  wss 3910   class class class wbr 5105  (class class class)co 7357  0cc0 11051  +∞cpnf 11186  *cxr 11188   < clt 11189  cle 11190  [,]cicc 13267
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-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128  ax-pre-sup 11129
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-po 5545  df-so 5546  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-icc 13271
This theorem is referenced by:  xrge0infssd  31666  infxrge0lb  31669  infxrge0glb  31670  infxrge0gelb  31671  omsf  32896  omssubaddlem  32899  omssubadd  32900
  Copyright terms: Public domain W3C validator