| 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 2922 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfv 1946 | . . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) < -∞ | |
| 4 | pimltmnf2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
| 5 | nfcv 2922 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 6 | 4, 5 | nffv 6896 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 7 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑥 < | |
| 8 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑥-∞ | |
| 9 | 6, 7, 8 | nfbr 5151 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) < -∞ |
| 10 | fveq2 6886 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 11 | 10 | breq1d 5112 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) < -∞ ↔ (𝐹‘𝑦) < -∞)) |
| 12 | 1, 2, 3, 9, 11 | cbvrabw 3446 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} |
| 13 | pimltmnf2f.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) | |
| 14 | 13 | ffvelcdmda 7085 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ) |
| 15 | 14 | rexrd 11363 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ*) |
| 16 | 15 | mnfled 13269 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ≤ (𝐹‘𝑦)) |
| 17 | mnfxr 11370 | . . . . . . 7 ⊢ -∞ ∈ ℝ* | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ∈ ℝ*) |
| 19 | 18, 15 | xrlenltd 11379 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (-∞ ≤ (𝐹‘𝑦) ↔ ¬ (𝐹‘𝑦) < -∞)) |
| 20 | 16, 19 | mpbid 235 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ (𝐹‘𝑦) < -∞) |
| 21 | 20 | ralrimiva 3154 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) |
| 22 | rabeq0 4337 | . . 3 ⊢ ({𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) | |
| 23 | 21, 22 | sylibr 237 | . 2 ⊢ (𝜑 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅) |
| 24 | 12, 23 | eqtrid 2807 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Ⅎwnfc 2907 ∀wral 3076 {crab 3412 ∅c0 4278 class class class wbr 5102 ⟶wf 6535 ‘cfv 6539 ℝcr 11203 -∞cmnf 11345 ℝ*cxr 11346 < clt 11347 ≤ cle 11348 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 |
| This theorem is used by: pimltmnf2 47802 smfpimltxr 47851 |
| Copyright terms: Public domain | W3C validator |