| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cncfioobdlem | Structured version Visualization version GIF version | ||
| Description: 𝐺 actually extends 𝐹. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| cncfioobdlem.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| cncfioobdlem.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| cncfioobdlem.f | ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶𝑉) |
| cncfioobdlem.g | ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)))) |
| cncfioobdlem.c | ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵)) |
| Ref | Expression |
|---|---|
| cncfioobdlem | ⊢ (𝜑 → (𝐺‘𝐶) = (𝐹‘𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cncfioobdlem.g | . . 3 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)))) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))) |
| 3 | cncfioobdlem.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 4 | 3 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 ∈ ℝ) |
| 5 | cncfioobdlem.c | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵)) | |
| 6 | 3 | rexrd 11260 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 7 | cncfioobdlem.b | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 8 | 7 | rexrd 11260 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| 9 | elioo2 13414 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 10 | 6, 8, 9 | syl2anc 595 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 11 | 5, 10 | mpbid 235 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) |
| 12 | 11 | simp2d 1161 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐶) |
| 13 | 12 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝐶) |
| 14 | eqcom 2770 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 ↔ 𝐶 = 𝑥) | |
| 15 | 14 | bilani 509 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 = 𝑥) |
| 16 | 13, 15 | breqtrd 5138 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝑥) |
| 17 | 4, 16 | gtned 11346 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐴) |
| 18 | 17 | neneqd 2963 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐴) |
| 19 | 18 | iffalsed 4499 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) |
| 20 | simpr 489 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 = 𝐶) | |
| 21 | 5 | elioored 46245 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 22 | 21 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 ∈ ℝ) |
| 23 | 20, 22 | eqeltrd 2863 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ∈ ℝ) |
| 24 | 11 | simp3d 1162 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 < 𝐵) |
| 25 | 24 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 < 𝐵) |
| 26 | 20, 25 | eqbrtrd 5134 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 < 𝐵) |
| 27 | 23, 26 | ltned 11347 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐵) |
| 28 | 27 | neneqd 2963 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐵) |
| 29 | 28 | iffalsed 4499 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥)) |
| 30 | 20 | fveq2d 6887 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → (𝐹‘𝑥) = (𝐹‘𝐶)) |
| 31 | 19, 29, 30 | 3eqtrd 2802 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝐶)) |
| 32 | ioossicc 13461 | . . 3 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
| 33 | 32, 5 | sselid 3936 | . 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
| 34 | cncfioobdlem.f | . . 3 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶𝑉) | |
| 35 | 34, 5 | ffvelcdmd 7082 | . 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑉) |
| 36 | 2, 31, 33, 35 | fvmptd 6999 | 1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝐹‘𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ifcif 4488 class class class wbr 5110 ↦ cmpt 5193 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 ℝcr 11100 ℝ*cxr 11243 < clt 11244 (,)cioo 13373 [,]cicc 13376 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-pre-lttri 11175 ax-pre-lttrn 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-ioo 13377 df-icc 13380 |
| This theorem is referenced by: cncfioobd 46591 |
| Copyright terms: Public domain | W3C validator |