Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > preimaicomnf | Structured version Visualization version GIF version |
Description: Preimage of an open interval, unbounded below. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
preimaicomnf.1 | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) |
preimaicomnf.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
Ref | Expression |
---|---|
preimaicomnf | ⊢ (𝜑 → (◡𝐹 “ (-∞[,)𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preimaicomnf.1 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) | |
2 | 1 | ffnd 5959 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
3 | fncnvima2 6247 | . . 3 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ (-∞[,)𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ (-∞[,)𝐵)}) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝜑 → (◡𝐹 “ (-∞[,)𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ (-∞[,)𝐵)}) |
5 | mnfxr 9975 | . . . . . . 7 ⊢ -∞ ∈ ℝ* | |
6 | 5 | a1i 11 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ∈ (-∞[,)𝐵)) → -∞ ∈ ℝ*) |
7 | preimaicomnf.2 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
8 | 7 | ad2antrr 758 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ∈ (-∞[,)𝐵)) → 𝐵 ∈ ℝ*) |
9 | simpr 476 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ∈ (-∞[,)𝐵)) → (𝐹‘𝑥) ∈ (-∞[,)𝐵)) | |
10 | icoltub 38579 | . . . . . 6 ⊢ ((-∞ ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ (𝐹‘𝑥) ∈ (-∞[,)𝐵)) → (𝐹‘𝑥) < 𝐵) | |
11 | 6, 8, 9, 10 | syl3anc 1318 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ∈ (-∞[,)𝐵)) → (𝐹‘𝑥) < 𝐵) |
12 | 11 | ex 449 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) ∈ (-∞[,)𝐵) → (𝐹‘𝑥) < 𝐵)) |
13 | 5 | a1i 11 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) < 𝐵) → -∞ ∈ ℝ*) |
14 | 7 | ad2antrr 758 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) < 𝐵) → 𝐵 ∈ ℝ*) |
15 | 1 | ffvelrnda 6267 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ ℝ*) |
16 | 15 | adantr 480 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) < 𝐵) → (𝐹‘𝑥) ∈ ℝ*) |
17 | 15 | mnfled 38550 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -∞ ≤ (𝐹‘𝑥)) |
18 | 17 | adantr 480 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) < 𝐵) → -∞ ≤ (𝐹‘𝑥)) |
19 | simpr 476 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) < 𝐵) → (𝐹‘𝑥) < 𝐵) | |
20 | 13, 14, 16, 18, 19 | elicod 12095 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) < 𝐵) → (𝐹‘𝑥) ∈ (-∞[,)𝐵)) |
21 | 20 | ex 449 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) < 𝐵 → (𝐹‘𝑥) ∈ (-∞[,)𝐵))) |
22 | 12, 21 | impbid 201 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) ∈ (-∞[,)𝐵) ↔ (𝐹‘𝑥) < 𝐵)) |
23 | 22 | rabbidva 3163 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ∈ (-∞[,)𝐵)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐵}) |
24 | 4, 23 | eqtrd 2644 | 1 ⊢ (𝜑 → (◡𝐹 “ (-∞[,)𝐵)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {crab 2900 class class class wbr 4583 ◡ccnv 5037 “ cima 5041 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 -∞cmnf 9951 ℝ*cxr 9952 < clt 9953 ≤ cle 9954 [,)cico 12048 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-ico 12052 |
This theorem is referenced by: preimaioomnf 39606 |
Copyright terms: Public domain | W3C validator |