| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pimltmnf2f | Structured version Visualization version GIF version | ||
| Description: Given a real-valued function, the preimage of an open interval, unbounded below, with upper bound -∞, is the empty set. (Contributed by Glauco Siliprandi, 15-Dec-2024.) |
| Ref | Expression |
|---|---|
| pimltmnf2f.1 | ⊢ Ⅎ𝑥𝐹 |
| pimltmnf2f.2 | ⊢ Ⅎ𝑥𝐴 |
| pimltmnf2f.3 | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) |
| Ref | Expression |
|---|---|
| pimltmnf2f | ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pimltmnf2f.2 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2925 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfv 1944 | . . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) < -∞ | |
| 4 | pimltmnf2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
| 5 | nfcv 2925 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 6 | 4, 5 | nffv 6893 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 7 | nfcv 2925 | . . . 4 ⊢ Ⅎ𝑥 < | |
| 8 | nfcv 2925 | . . . 4 ⊢ Ⅎ𝑥-∞ | |
| 9 | 6, 7, 8 | nfbr 5159 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) < -∞ |
| 10 | fveq2 6883 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 11 | 10 | breq1d 5120 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) < -∞ ↔ (𝐹‘𝑦) < -∞)) |
| 12 | 1, 2, 3, 9, 11 | cbvrabw 3451 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} |
| 13 | pimltmnf2f.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) | |
| 14 | 13 | ffvelcdmda 7081 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ) |
| 15 | 14 | rexrd 11260 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ*) |
| 16 | 15 | mnfled 13162 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ≤ (𝐹‘𝑦)) |
| 17 | mnfxr 11267 | . . . . . . 7 ⊢ -∞ ∈ ℝ* | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ∈ ℝ*) |
| 19 | 18, 15 | xrlenltd 11276 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (-∞ ≤ (𝐹‘𝑦) ↔ ¬ (𝐹‘𝑦) < -∞)) |
| 20 | 16, 19 | mpbid 235 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ (𝐹‘𝑦) < -∞) |
| 21 | 20 | ralrimiva 3157 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) |
| 22 | rabeq0 4346 | . . 3 ⊢ ({𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) | |
| 23 | 21, 22 | sylibr 237 | . 2 ⊢ (𝜑 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅) |
| 24 | 12, 23 | eqtrid 2810 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Ⅎwnfc 2910 ∀wral 3079 {crab 3416 ∅c0 4287 class class class wbr 5110 ⟶wf 6534 ‘cfv 6538 ℝcr 11100 -∞cmnf 11242 ℝ*cxr 11243 < clt 11244 ≤ cle 11245 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 |
| This theorem is referenced by: pimltmnf2 47395 smfpimltxr 47444 |
| Copyright terms: Public domain | W3C validator |