| 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 2926 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 3 | nfv 1949 | . . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) < -∞ | |
| 4 | pimltmnf2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
| 5 | nfcv 2926 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
| 6 | 4, 5 | nffv 6921 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
| 7 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑥 < | |
| 8 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑥-∞ | |
| 9 | 6, 7, 8 | nfbr 5156 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) < -∞ |
| 10 | fveq2 6911 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
| 11 | 10 | breq1d 5116 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) < -∞ ↔ (𝐹‘𝑦) < -∞)) |
| 12 | 1, 2, 3, 9, 11 | cbvrabw 3450 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} |
| 13 | pimltmnf2f.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) | |
| 14 | 13 | ffvelcdmda 7111 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ) |
| 15 | 14 | rexrd 11389 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ*) |
| 16 | 15 | mnfled 13295 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ≤ (𝐹‘𝑦)) |
| 17 | mnfxr 11396 | . . . . . . 7 ⊢ -∞ ∈ ℝ* | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ ∈ ℝ*) |
| 19 | 18, 15 | xrlenltd 11405 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (-∞ ≤ (𝐹‘𝑦) ↔ ¬ (𝐹‘𝑦) < -∞)) |
| 20 | 16, 19 | mpbid 235 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ (𝐹‘𝑦) < -∞) |
| 21 | 20 | ralrimiva 3158 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) |
| 22 | rabeq0 4341 | . . 3 ⊢ ({𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ (𝐹‘𝑦) < -∞) | |
| 23 | 21, 22 | sylibr 237 | . 2 ⊢ (𝜑 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) < -∞} = ∅) |
| 24 | 12, 23 | eqtrid 2810 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < -∞} = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Ⅎwnfc 2911 ∀wral 3080 {crab 3416 ∅c0 4281 class class class wbr 5106 ⟶wf 6557 ‘cfv 6561 ℝcr 11229 -∞cmnf 11371 ℝ*cxr 11372 < clt 11373 ≤ cle 11374 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 |
| This theorem is used by: pimltmnf2 47923 smfpimltxr 47972 |
| Copyright terms: Public domain | W3C validator |