![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > preimaiocmnf | Structured version Visualization version GIF version |
Description: Preimage of a right-closed interval, unbounded below. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
preimaiocmnf.1 | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) |
preimaiocmnf.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
Ref | Expression |
---|---|
preimaiocmnf | ⊢ (𝜑 → (◡𝐹 “ (-∞(,]𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≤ 𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preimaiocmnf.1 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ) | |
2 | 1 | ffnd 6488 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
3 | fncnvima2 6808 | . . 3 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ (-∞(,]𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ (-∞(,]𝐵)}) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞(,]𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ (-∞(,]𝐵)}) |
5 | mnfxr 10687 | . . . . . . . 8 ⊢ -∞ ∈ ℝ* | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ (-∞(,]𝐵)) → -∞ ∈ ℝ*) |
7 | preimaiocmnf.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
8 | 7 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ (-∞(,]𝐵)) → 𝐵 ∈ ℝ*) |
9 | simpr 488 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ (-∞(,]𝐵)) → (𝐹‘𝑥) ∈ (-∞(,]𝐵)) | |
10 | 6, 8, 9 | iocleubd 42196 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ∈ (-∞(,]𝐵)) → (𝐹‘𝑥) ≤ 𝐵) |
11 | 10 | ex 416 | . . . . 5 ⊢ (𝜑 → ((𝐹‘𝑥) ∈ (-∞(,]𝐵) → (𝐹‘𝑥) ≤ 𝐵)) |
12 | 11 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) ∈ (-∞(,]𝐵) → (𝐹‘𝑥) ≤ 𝐵)) |
13 | 5 | a1i 11 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ≤ 𝐵) → -∞ ∈ ℝ*) |
14 | 7 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹‘𝑥) ≤ 𝐵) → 𝐵 ∈ ℝ*) |
15 | 14 | adantlr 714 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ≤ 𝐵) → 𝐵 ∈ ℝ*) |
16 | 1 | ffvelrnda 6828 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ ℝ) |
17 | 16 | rexrd 10680 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ ℝ*) |
18 | 17 | adantr 484 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ≤ 𝐵) → (𝐹‘𝑥) ∈ ℝ*) |
19 | 16 | mnfltd 12507 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -∞ < (𝐹‘𝑥)) |
20 | 19 | adantr 484 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ≤ 𝐵) → -∞ < (𝐹‘𝑥)) |
21 | simpr 488 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ≤ 𝐵) → (𝐹‘𝑥) ≤ 𝐵) | |
22 | 13, 15, 18, 20, 21 | eliocd 42144 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ≤ 𝐵) → (𝐹‘𝑥) ∈ (-∞(,]𝐵)) |
23 | 22 | ex 416 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) ≤ 𝐵 → (𝐹‘𝑥) ∈ (-∞(,]𝐵))) |
24 | 12, 23 | impbid 215 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) ∈ (-∞(,]𝐵) ↔ (𝐹‘𝑥) ≤ 𝐵)) |
25 | 24 | rabbidva 3425 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ (-∞(,]𝐵)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≤ 𝐵}) |
26 | 4, 25 | eqtrd 2833 | 1 ⊢ (𝜑 → (◡𝐹 “ (-∞(,]𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≤ 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {crab 3110 class class class wbr 5030 ◡ccnv 5518 “ cima 5522 Fn wfn 6319 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 -∞cmnf 10662 ℝ*cxr 10663 < clt 10664 ≤ cle 10665 (,]cioc 12727 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-ioc 12731 |
This theorem is referenced by: issmfle2d 43440 |
Copyright terms: Public domain | W3C validator |