![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pimconstlt1 | Structured version Visualization version GIF version |
Description: Given a constant function, its preimage with respect to an unbounded below, open interval, with upper bound larger than the constant, is the whole domain. First part of Proposition 121E (a) of [Fremlin1] p. 37 . (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
pimconstlt1.1 | ⊢ Ⅎ𝑥𝜑 |
pimconstlt1.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
pimconstlt1.3 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
pimconstlt1.4 | ⊢ (𝜑 → 𝐵 < 𝐶) |
Ref | Expression |
---|---|
pimconstlt1 | ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssrab2 4007 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ⊆ 𝐴 | |
2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ⊆ 𝐴) |
3 | pimconstlt1.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
4 | simpr 488 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
5 | pimconstlt1.3 | . . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
6 | 5 | a1i 11 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
7 | pimconstlt1.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
8 | 7 | adantr 484 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
9 | 6, 8 | fvmpt2d 6758 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) |
10 | pimconstlt1.4 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 < 𝐶) | |
11 | 10 | adantr 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 < 𝐶) |
12 | 9, 11 | eqbrtrd 5052 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) < 𝐶) |
13 | 4, 12 | jca 515 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) < 𝐶)) |
14 | rabid 3331 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) < 𝐶)) | |
15 | 13, 14 | sylibr 237 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
16 | 15 | ex 416 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶})) |
17 | 3, 16 | ralrimi 3180 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
18 | nfcv 2955 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
19 | nfrab1 3337 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} | |
20 | 18, 19 | dfss3f 3906 | . . 3 ⊢ (𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
21 | 17, 20 | sylibr 237 | . 2 ⊢ (𝜑 → 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
22 | 2, 21 | eqssd 3932 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 Ⅎwnf 1785 ∈ wcel 2111 ∀wral 3106 {crab 3110 ⊆ wss 3881 class class class wbr 5030 ↦ cmpt 5110 ‘cfv 6324 ℝcr 10525 < clt 10664 |
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 |
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-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 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-fv 6332 |
This theorem is referenced by: smfconst 43383 |
Copyright terms: Public domain | W3C validator |