![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > xrge0f | Structured version Visualization version GIF version |
Description: A real function is a nonnegative extended real function if all its values are greater than or equal to zero. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 28-Jul-2014.) |
Ref | Expression |
---|---|
xrge0f | ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ffn 6737 | . . 3 ⊢ (𝐹:ℝ⟶ℝ → 𝐹 Fn ℝ) | |
2 | 1 | adantr 480 | . 2 ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 Fn ℝ) |
3 | ax-resscn 11210 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
4 | 3 | a1i 11 | . . . . 5 ⊢ (𝐹:ℝ⟶ℝ → ℝ ⊆ ℂ) |
5 | 4, 1 | 0pledm 25722 | . . . 4 ⊢ (𝐹:ℝ⟶ℝ → (0𝑝 ∘r ≤ 𝐹 ↔ (ℝ × {0}) ∘r ≤ 𝐹)) |
6 | 0re 11261 | . . . . . 6 ⊢ 0 ∈ ℝ | |
7 | fnconstg 6797 | . . . . . 6 ⊢ (0 ∈ ℝ → (ℝ × {0}) Fn ℝ) | |
8 | 6, 7 | mp1i 13 | . . . . 5 ⊢ (𝐹:ℝ⟶ℝ → (ℝ × {0}) Fn ℝ) |
9 | reex 11244 | . . . . . 6 ⊢ ℝ ∈ V | |
10 | 9 | a1i 11 | . . . . 5 ⊢ (𝐹:ℝ⟶ℝ → ℝ ∈ V) |
11 | inidm 4235 | . . . . 5 ⊢ (ℝ ∩ ℝ) = ℝ | |
12 | c0ex 11253 | . . . . . . 7 ⊢ 0 ∈ V | |
13 | 12 | fvconst2 7224 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → ((ℝ × {0})‘𝑥) = 0) |
14 | 13 | adantl 481 | . . . . 5 ⊢ ((𝐹:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → ((ℝ × {0})‘𝑥) = 0) |
15 | eqidd 2736 | . . . . 5 ⊢ ((𝐹:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
16 | 8, 1, 10, 10, 11, 14, 15 | ofrfval 7707 | . . . 4 ⊢ (𝐹:ℝ⟶ℝ → ((ℝ × {0}) ∘r ≤ 𝐹 ↔ ∀𝑥 ∈ ℝ 0 ≤ (𝐹‘𝑥))) |
17 | ffvelcdm 7101 | . . . . . . . 8 ⊢ ((𝐹:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ ℝ) | |
18 | 17 | rexrd 11309 | . . . . . . 7 ⊢ ((𝐹:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ ℝ*) |
19 | 18 | biantrurd 532 | . . . . . 6 ⊢ ((𝐹:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (0 ≤ (𝐹‘𝑥) ↔ ((𝐹‘𝑥) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝑥)))) |
20 | elxrge0 13494 | . . . . . 6 ⊢ ((𝐹‘𝑥) ∈ (0[,]+∞) ↔ ((𝐹‘𝑥) ∈ ℝ* ∧ 0 ≤ (𝐹‘𝑥))) | |
21 | 19, 20 | bitr4di 289 | . . . . 5 ⊢ ((𝐹:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (0 ≤ (𝐹‘𝑥) ↔ (𝐹‘𝑥) ∈ (0[,]+∞))) |
22 | 21 | ralbidva 3174 | . . . 4 ⊢ (𝐹:ℝ⟶ℝ → (∀𝑥 ∈ ℝ 0 ≤ (𝐹‘𝑥) ↔ ∀𝑥 ∈ ℝ (𝐹‘𝑥) ∈ (0[,]+∞))) |
23 | 5, 16, 22 | 3bitrd 305 | . . 3 ⊢ (𝐹:ℝ⟶ℝ → (0𝑝 ∘r ≤ 𝐹 ↔ ∀𝑥 ∈ ℝ (𝐹‘𝑥) ∈ (0[,]+∞))) |
24 | 23 | biimpa 476 | . 2 ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → ∀𝑥 ∈ ℝ (𝐹‘𝑥) ∈ (0[,]+∞)) |
25 | ffnfv 7139 | . 2 ⊢ (𝐹:ℝ⟶(0[,]+∞) ↔ (𝐹 Fn ℝ ∧ ∀𝑥 ∈ ℝ (𝐹‘𝑥) ∈ (0[,]+∞))) | |
26 | 2, 24, 25 | sylanbrc 583 | 1 ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∀wral 3059 Vcvv 3478 ⊆ wss 3963 {csn 4631 class class class wbr 5148 × cxp 5687 Fn wfn 6558 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ∘r cofr 7696 ℂcc 11151 ℝcr 11152 0cc0 11153 +∞cpnf 11290 ℝ*cxr 11292 ≤ cle 11294 [,]cicc 13387 0𝑝c0p 25718 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-i2m1 11221 ax-rnegex 11224 ax-cnre 11226 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-ofr 7698 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-icc 13391 df-0p 25719 |
This theorem is referenced by: itg2itg1 25786 |
Copyright terms: Public domain | W3C validator |