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 33239
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 3929 . . . . . . 7 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑦𝐴) → 𝑦 ∈ (0[,]+∞))
2 0xr 11284 . . . . . . . . 9 0 ∈ ℝ*
3 pnfxr 11291 . . . . . . . . 9 +∞ ∈ ℝ*
4 iccgelb 13459 . . . . . . . . 9 ((0 ∈ ℝ* ∧ +∞ ∈ ℝ*𝑦 ∈ (0[,]+∞)) → 0 ≤ 𝑦)
52, 3, 4mp3an12 1480 . . . . . . . 8 (𝑦 ∈ (0[,]+∞) → 0 ≤ 𝑦)
6 eliccxr 13492 . . . . . . . . 9 (𝑦 ∈ (0[,]+∞) → 𝑦 ∈ ℝ*)
7 xrlenlt 11302 . . . . . . . . 9 ((0 ∈ ℝ*𝑦 ∈ ℝ*) → (0 ≤ 𝑦 ↔ ¬ 𝑦 < 0))
82, 6, 7sylancr 599 . . . . . . . 8 (𝑦 ∈ (0[,]+∞) → (0 ≤ 𝑦 ↔ ¬ 𝑦 < 0))
95, 8mpbid 235 . . . . . . 7 (𝑦 ∈ (0[,]+∞) → ¬ 𝑦 < 0)
101, 9syl 18 . . . . . 6 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑦𝐴) → ¬ 𝑦 < 0)
1110ralrimiva 3156 . . . . 5 (𝐴 ⊆ (0[,]+∞) → ∀𝑦𝐴 ¬ 𝑦 < 0)
1211ad3antrrr 743 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∀𝑦𝐴 ¬ 𝑦 < 0)
13 iccssxr 13487 . . . . . . . . . 10 (0[,]+∞) ⊆ ℝ*
14 ssralv 4003 . . . . . . . . . 10 ((0[,]+∞) ⊆ ℝ* → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
1513, 14ax-mp 5 . . . . . . . . 9 (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
16 simplll 787 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 ∈ ℝ*)
172a1i 11 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 0 ∈ ℝ*)
18 simplr 781 . . . . . . . . . . . . . 14 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑦 ∈ (0[,]+∞))
1913, 18sselid 3932 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑦 ∈ ℝ*)
20 simpllr 788 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 ≤ 0)
21 simpr 490 . . . . . . . . . . . . 13 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 0 < 𝑦)
2216, 17, 19, 20, 21xrlelttrd 13215 . . . . . . . . . . . 12 ((((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) ∧ 0 < 𝑦) → 𝑤 < 𝑦)
2322ex 418 . . . . . . . . . . 11 (((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) → (0 < 𝑦𝑤 < 𝑦))
2423imim1d 83 . . . . . . . . . 10 (((𝑤 ∈ ℝ*𝑤 ≤ 0) ∧ 𝑦 ∈ (0[,]+∞)) → ((𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → (0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2524ralimdva 3176 . . . . . . . . 9 ((𝑤 ∈ ℝ*𝑤 ≤ 0) → (∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2615, 25syl5 35 . . . . . . . 8 ((𝑤 ∈ ℝ*𝑤 ≤ 0) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2726adantll 727 . . . . . . 7 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
2827imp 412 . . . . . 6 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
2928adantrl 729 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ 𝑤 ≤ 0) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
3029an32s 665 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))
31 0e0iccpnf 13516 . . . . 5 0 ∈ (0[,]+∞)
32 breq2 5111 . . . . . . . . 9 (𝑥 = 0 → (𝑦 < 𝑥𝑦 < 0))
3332notbid 321 . . . . . . . 8 (𝑥 = 0 → (¬ 𝑦 < 𝑥 ↔ ¬ 𝑦 < 0))
3433ralbidv 3187 . . . . . . 7 (𝑥 = 0 → (∀𝑦𝐴 ¬ 𝑦 < 𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦 < 0))
35 breq1 5110 . . . . . . . . 9 (𝑥 = 0 → (𝑥 < 𝑦 ↔ 0 < 𝑦))
3635imbi1d 344 . . . . . . . 8 (𝑥 = 0 → ((𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ (0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
3736ralbidv 3187 . . . . . . 7 (𝑥 = 0 → (∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
3834, 37anbi12d 644 . . . . . 6 (𝑥 = 0 → ((∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) ↔ (∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
3938rspcev 3579 . . . . 5 ((0 ∈ (0[,]+∞) ∧ (∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4031, 39mpan 703 . . . 4 ((∀𝑦𝐴 ¬ 𝑦 < 0 ∧ ∀𝑦 ∈ (0[,]+∞)(0 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4112, 30, 40syl2anc 596 . . 3 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 𝑤 ≤ 0) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
42 simpllr 788 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 𝑤 ∈ ℝ*)
43 simpr 490 . . . . 5 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 0 ≤ 𝑤)
44 elxrge0 13514 . . . . 5 (𝑤 ∈ (0[,]+∞) ↔ (𝑤 ∈ ℝ* ∧ 0 ≤ 𝑤))
4542, 43, 44sylanbrc 595 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → 𝑤 ∈ (0[,]+∞))
4615a1i 11 . . . . . . . 8 (𝐴 ⊆ (0[,]+∞) → (∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) → ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
4746anim2d 624 . . . . . . 7 (𝐴 ⊆ (0[,]+∞) → ((∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
4847adantr 486 . . . . . 6 ((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) → ((∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
4948imp 412 . . . . 5 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5049adantr 486 . . . 4 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
51 breq2 5111 . . . . . . . 8 (𝑥 = 𝑤 → (𝑦 < 𝑥𝑦 < 𝑤))
5251notbid 321 . . . . . . 7 (𝑥 = 𝑤 → (¬ 𝑦 < 𝑥 ↔ ¬ 𝑦 < 𝑤))
5352ralbidv 3187 . . . . . 6 (𝑥 = 𝑤 → (∀𝑦𝐴 ¬ 𝑦 < 𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦 < 𝑤))
54 breq1 5110 . . . . . . . 8 (𝑥 = 𝑤 → (𝑥 < 𝑦𝑤 < 𝑦))
5554imbi1d 344 . . . . . . 7 (𝑥 = 𝑤 → ((𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5655ralbidv 3187 . . . . . 6 (𝑥 = 𝑤 → (∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦) ↔ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5753, 56anbi12d 644 . . . . 5 (𝑥 = 𝑤 → ((∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)) ↔ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))))
5857rspcev 3579 . . . 4 ((𝑤 ∈ (0[,]+∞) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
5945, 50, 58syl2anc 596 . . 3 ((((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) ∧ 0 ≤ 𝑤) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
60 simplr 781 . . . 4 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → 𝑤 ∈ ℝ*)
612a1i 11 . . . 4 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → 0 ∈ ℝ*)
62 xrletri 13208 . . . 4 ((𝑤 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝑤 ≤ 0 ∨ 0 ≤ 𝑤))
6360, 61, 62syl2anc 596 . . 3 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → (𝑤 ≤ 0 ∨ 0 ≤ 𝑤))
6441, 59, 63mpjaodan 973 . 2 (((𝐴 ⊆ (0[,]+∞) ∧ 𝑤 ∈ ℝ*) ∧ (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦))) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
65 sstr 3942 . . . 4 ((𝐴 ⊆ (0[,]+∞) ∧ (0[,]+∞) ⊆ ℝ*) → 𝐴 ⊆ ℝ*)
6613, 65mpan2 704 . . 3 (𝐴 ⊆ (0[,]+∞) → 𝐴 ⊆ ℝ*)
67 xrinfmss 13366 . . 3 (𝐴 ⊆ ℝ* → ∃𝑤 ∈ ℝ* (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
6866, 67syl 18 . 2 (𝐴 ⊆ (0[,]+∞) → ∃𝑤 ∈ ℝ* (∀𝑦𝐴 ¬ 𝑦 < 𝑤 ∧ ∀𝑦 ∈ ℝ* (𝑤 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
6964, 68r19.29a 3172 1 (𝐴 ⊆ (0[,]+∞) → ∃𝑥 ∈ (0[,]+∞)(∀𝑦𝐴 ¬ 𝑦 < 𝑥 ∧ ∀𝑦 ∈ (0[,]+∞)(𝑥 < 𝑦 → ∃𝑧𝐴 𝑧 < 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wo 861   = wceq 1570  wcel 2145  wral 3078  wrex 3088  wss 3902   class class class wbr 5107  (class class class)co 7417  0cc0 11128  +∞cpnf 11268  *cxr 11270   < clt 11271  cle 11272  [,]cicc 13405
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205  ax-pre-sup 11206
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-icc 13409
This theorem is used by:  xrge0infssd  33240  infxrge0lb  33243  infxrge0glb  33244  infxrge0gelb  33245  omsf  34815  omssubaddlem  34818  omssubadd  34819
  Copyright terms: Public domain W3C validator