| 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 2927 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfv 1937 | . . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) < -∞ | |
| 4 | pimltmnf2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
| 5 | nfcv 2927 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 6 | 4, 5 | nffv 6881 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 7 | nfcv 2927 | . . . 4 ⊢ Ⅎ𝑥 < | |
| 8 | nfcv 2927 | . . . 4 ⊢ Ⅎ𝑥-∞ | |
| 9 | 6, 7, 8 | nfbr 5151 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) < -∞ |
| 10 | fveq2 6871 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 11 | 10 | breq1d 5114 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) < -∞ ↔ (𝐹‘𝑦) < -∞)) |
| 12 | 1, 2, 3, 9, 11 | cbvrabw 3452 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} |
| 13 | pimltmnf2f.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) | |
| 14 | 13 | ffvelcdmda 7069 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ) |
| 15 | 14 | rexrd 11247 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ*) |
| 16 | 15 | mnfled 13149 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ≤ (𝐹‘𝑦)) |
| 17 | mnfxr 11254 | . . . . . . 7 ⊢ -∞ ∈ ℝ* | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ∈ ℝ*) |
| 19 | 18, 15 | xrlenltd 11263 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (-∞ ≤ (𝐹‘𝑦) ↔ ¬ (𝐹‘𝑦) < -∞)) |
| 20 | 16, 19 | mpbid 235 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ (𝐹‘𝑦) < -∞) |
| 21 | 20 | ralrimiva 3157 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) |
| 22 | rabeq0 4345 | . . 3 ⊢ ({𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) | |
| 23 | 21, 22 | sylibr 237 | . 2 ⊢ (𝜑 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅) |
| 24 | 12, 23 | eqtrid 2812 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 Ⅎwnfc 2912 ∀wral 3079 {crab 3417 ∅c0 4288 class class class wbr 5104 ⟶wf 6521 ‘cfv 6525 ℝcr 11087 -∞cmnf 11229 ℝ*cxr 11230 < clt 11231 ≤ cle 11232 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 |
| This theorem is referenced by: pimltmnf2 47271 smfpimltxr 47320 |
| Copyright terms: Public domain | W3C validator |