| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pimconstlt0 | Structured version Visualization version GIF version | ||
| Description: Given a constant function, its preimage with respect to an unbounded below, open interval, with upper bound less than or equal to the constant, is the empty set. Second part of Proposition 121E (a) of [Fremlin1] p. 37 . (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
| Ref | Expression |
|---|---|
| pimconstlt0.x | ⊢ Ⅎ𝑥𝜑 |
| pimconstlt0.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| pimconstlt0.f | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
| pimconstlt0.c | ⊢ (𝜑 → 𝐶 ∈ ℝ*) |
| pimconstlt0.l | ⊢ (𝜑 → 𝐶 ≤ 𝐵) |
| Ref | Expression |
|---|---|
| pimconstlt0 | ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pimconstlt0.x | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | pimconstlt0.l | . . . . . . 7 ⊢ (𝜑 → 𝐶 ≤ 𝐵) | |
| 3 | 2 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ≤ 𝐵) |
| 4 | pimconstlt0.f | . . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 5 | 4 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
| 6 | pimconstlt0.b | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 7 | 6 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
| 8 | 5, 7 | fvmpt2d 7038 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) |
| 9 | 3, 8 | breqtrrd 5139 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ≤ (𝐹‘𝑥)) |
| 10 | pimconstlt0.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℝ*) | |
| 11 | 10 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℝ*) |
| 12 | 8, 7 | eqeltrd 2864 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ ℝ) |
| 13 | 12 | rexrd 11398 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ ℝ*) |
| 14 | 11, 13 | xrlenltd 11414 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ≤ (𝐹‘𝑥) ↔ ¬ (𝐹‘𝑥) < 𝐶)) |
| 15 | 9, 14 | mpbid 235 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ (𝐹‘𝑥) < 𝐶) |
| 16 | 15 | ex 418 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → ¬ (𝐹‘𝑥) < 𝐶)) |
| 17 | 1, 16 | ralrimi 3264 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ¬ (𝐹‘𝑥) < 𝐶) |
| 18 | rabeq0 4341 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ (𝐹‘𝑥) < 𝐶) | |
| 19 | 17, 18 | sylibr 237 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 ∀wral 3080 {crab 3416 ∅c0 4281 class class class wbr 5108 ↦ cmpt 5192 ‘cfv 6566 ℝcr 11238 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 |
| 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 5255 ax-nul 5266 ax-pr 5398 |
| 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-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-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fv 6574 df-xr 11386 df-le 11388 |
| This theorem is used by: smfconst 48093 |
| Copyright terms: Public domain | W3C validator |