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 3650 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ⊆ 𝐴 | |
2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ⊆ 𝐴) |
3 | pimconstlt1.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
4 | simpr 476 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
5 | pimconstlt1.3 | . . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
6 | 5 | a1i 11 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
7 | pimconstlt1.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
8 | 7 | adantr 480 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
9 | 6, 8 | fvmpt2d 6202 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵) |
10 | pimconstlt1.4 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 < 𝐶) | |
11 | 10 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 < 𝐶) |
12 | 9, 11 | eqbrtrd 4605 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) < 𝐶) |
13 | 4, 12 | jca 553 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) < 𝐶)) |
14 | rabid 3095 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) < 𝐶)) | |
15 | 13, 14 | sylibr 223 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
16 | 15 | ex 449 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶})) |
17 | 3, 16 | ralrimi 2940 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
18 | nfcv 2751 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
19 | nfrab1 3099 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} | |
20 | 18, 19 | dfss3f 3560 | . . 3 ⊢ (𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
21 | 17, 20 | sylibr 223 | . 2 ⊢ (𝜑 → 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶}) |
22 | 2, 21 | eqssd 3585 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) < 𝐶} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 Ⅎwnf 1699 ∈ wcel 1977 ∀wral 2896 {crab 2900 ⊆ wss 3540 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 ℝcr 9814 < clt 9953 |
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 |
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-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-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-fv 5812 |
This theorem is referenced by: smfconst 39636 |
Copyright terms: Public domain | W3C validator |