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 30510
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 3910 . . . . . . 7 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑦𝐴) → 𝑦 ∈ (0[,]+∞))
2 0xr 10677 . . . . . . . . 9 0 ∈ ℝ*
3 pnfxr 10684 . . . . . . . . 9 +∞ ∈ ℝ*
4 iccgelb 12781 . . . . . . . . 9 ((0 ∈ ℝ* ∧ +∞ ∈ ℝ*𝑦 ∈ (0[,]+∞)) → 0 ≤ 𝑦)
52, 3, 4mp3an12 1448 . . . . . . . 8 (𝑦 ∈ (0[,]+∞) → 0 ≤ 𝑦)
6 eliccxr 12813 . . . . . . . . 9 (𝑦 ∈ (0[,]+∞) → 𝑦 ∈ ℝ*)
7 xrlenlt 10695 . . . . . . . . 9 ((0 ∈ ℝ*𝑦 ∈ ℝ*) → (0 ≤ 𝑦 ↔ ¬ 𝑦 < 0))
82, 6, 7sylancr 590 . . . . . . . 8 (𝑦 ∈ (0[,]+∞) → (0 ≤ 𝑦 ↔ ¬ 𝑦 < 0))
95, 8mpbid 235 . . . . . . 7 (𝑦 ∈ (0[,]+∞) → ¬ 𝑦 < 0)
101, 9syl 17 . . . . . 6 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑦𝐴) → ¬ 𝑦 < 0)
1110ralrimiva 3149 . . . . 5 (𝐴 ⊆ (0[,]+∞) → ∀𝑦𝐴 ¬ 𝑦 < 0)
1211ad3antrrr 729 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∀𝑦𝐴 ¬ 𝑦 < 0)
13 iccssxr 12808 . . . . . . . . . 10 (0[,]+∞) ⊆ ℝ*
14 ssralv 3981 . . . . . . . . . 10 ((0[,]+∞) ⊆ ℝ* → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
1513, 14ax-mp 5 . . . . . . . . 9 (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
16 simplll 774 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 ∈ ℝ*)
172a1i 11 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 0 ∈ ℝ*)
18 simplr 768 . . . . . . . . . . . . . 14 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑦 ∈ (0[,]+∞))
1913, 18sseldi 3913 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑦 ∈ ℝ*)
20 simpllr 775 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 ≤ 0)
21 simpr 488 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 0 < 𝑦)
2216, 17, 19, 20, 21xrlelttrd 12541 . . . . . . . . . . . 12 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 < 𝑦)
2322ex 416 . . . . . . . . . . 11 (((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) → (0 < 𝑦𝑤 < 𝑦))
2423imim1d 82 . . . . . . . . . 10 (((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) → ((𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → (0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2524ralimdva 3144 . . . . . . . . 9 ((𝑤 ∈ ℝ*𝑤 ≤ 0) → (∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2615, 25syl5 34 . . . . . . . 8 ((𝑤 ∈ ℝ*𝑤 ≤ 0) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2726adantll 713 . . . . . . 7 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2827imp 410 . . . . . 6 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
2928adantrl 715 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
3029an32s 651 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
31 0e0iccpnf 12837 . . . . 5 0 ∈ (0[,]+∞)
32 breq2 5034 . . . . . . . . 9 (𝑥 = 0 → (𝑦 < 𝑥𝑦 < 0))
3332notbid 321 . . . . . . . 8 (𝑥 = 0 → (¬ 𝑦 < 𝑥 ↔ ¬ 𝑦 < 0))
3433ralbidv 3162 . . . . . . 7 (𝑥 = 0 → (∀𝑦𝐴 ¬ 𝑦 < 𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦 < 0))
35 breq1 5033 . . . . . . . . 9 (𝑥 = 0 → (𝑥 < 𝑦 ↔ 0 < 𝑦))
3635imbi1d 345 . . . . . . . 8 (𝑥 = 0 → ((𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ (0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
3736ralbidv 3162 . . . . . . 7 (𝑥 = 0 → (∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
3834, 37anbi12d 633 . . . . . 6 (𝑥 = 0 → ((∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) ↔ (∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
3938rspcev 3571 . . . . 5 ((0 ∈ (0[,]+∞) ∧ (∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4031, 39mpan 689 . . . 4 ((∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4112, 30, 40syl2anc 587 . . 3 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
42 simpllr 775 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 𝑤 ∈ ℝ*)
43 simpr 488 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 0 ≤ 𝑤)
44 elxrge0 12835 . . . . 5 (𝑤 ∈ (0[,]+∞) ↔ (𝑤 ∈ ℝ* ∧ 0 ≤ 𝑤))
4542, 43, 44sylanbrc 586 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 𝑤 ∈ (0[,]+∞))
4615a1i 11 . . . . . . . 8 (𝐴 ⊆ (0[,]+∞) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4746anim2d 614 . . . . . . 7 (𝐴 ⊆ (0[,]+∞) → ((∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
4847adantr 484 . . . . . 6 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) → ((∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
4948imp 410 . . . . 5 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5049adantr 484 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
51 breq2 5034 . . . . . . . 8 (𝑥 = 𝑤 → (𝑦 < 𝑥𝑦 < 𝑤))
5251notbid 321 . . . . . . 7 (𝑥 = 𝑤 → (¬ 𝑦 < 𝑥 ↔ ¬ 𝑦 < 𝑤))
5352ralbidv 3162 . . . . . 6 (𝑥 = 𝑤 → (∀𝑦𝐴 ¬ 𝑦 < 𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦 < 𝑤))
54 breq1 5033 . . . . . . . 8 (𝑥 = 𝑤 → (𝑥 < 𝑦𝑤 < 𝑦))
5554imbi1d 345 . . . . . . 7 (𝑥 = 𝑤 → ((𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5655ralbidv 3162 . . . . . 6 (𝑥 = 𝑤 → (∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5753, 56anbi12d 633 . . . . 5 (𝑥 = 𝑤 → ((∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) ↔ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
5857rspcev 3571 . . . 4 ((𝑤 ∈ (0[,]+∞) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5945, 50, 58syl2anc 587 . . 3 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
60 simplr 768 . . . 4 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → 𝑤 ∈ ℝ*)
612a1i 11 . . . 4 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → 0 ∈ ℝ*)
62 xrletri 12534 . . . 4 ((𝑤 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝑤 ≤ 0 ∨ 0 ≤ 𝑤))
6360, 61, 62syl2anc 587 . . 3 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → (𝑤 ≤ 0 ∨ 0 ≤ 𝑤))
6441, 59, 63mpjaodan 956 . 2 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
65 sstr 3923 . . . 4 ((𝐴 ⊆ (0[,]+∞) ∧ (0[,]+∞) ⊆ ℝ*) → 𝐴 ⊆ ℝ*)
6613, 65mpan2 690 . . 3 (𝐴 ⊆ (0[,]+∞) → 𝐴 ⊆ ℝ*)
67 xrinfmss 12691 . . 3 (𝐴 ⊆ ℝ* → ∃𝑤 ∈ ℝ* (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
6866, 67syl 17 . 2 (𝐴 ⊆ (0[,]+∞) → ∃𝑤 ∈ ℝ* (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
6964, 68r19.29a 3248 1 (𝐴 ⊆ (0[,]+∞) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  wo 844   = wceq 1538  wcel 2111  wral 3106  wrex 3107  wss 3881   class class class wbr 5030  (class class class)co 7135  0cc0 10526  +∞cpnf 10661  *cxr 10663   < clt 10664  cle 10665  [,]cicc 12729
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-po 5438  df-so 5439  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-icc 12733
This theorem is referenced by:  xrge0infssd  30511  infxrge0lb  30514  infxrge0glb  30515  infxrge0gelb  30516  omsf  31664  omssubaddlem  31667  omssubadd  31668
  Copyright terms: Public domain W3C validator