| 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 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 ∈ ℝ) |
| 5 | cncfioobdlem.c | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵)) | |
| 6 | 3 | rexrd 11193 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 7 | cncfioobdlem.b | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 8 | 7 | rexrd 11193 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| 9 | elioo2 13337 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 10 | 6, 8, 9 | syl2anc 590 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 11 | 5, 10 | mpbid 233 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) |
| 12 | 11 | simp2d 1149 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐶) |
| 13 | 12 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝐶) |
| 14 | eqcom 2747 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 ↔ 𝐶 = 𝑥) | |
| 15 | 14 | bilani 505 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 = 𝑥) |
| 16 | 13, 15 | breqtrd 5105 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝑥) |
| 17 | 4, 16 | gtned 11279 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐴) |
| 18 | 17 | neneqd 2940 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐴) |
| 19 | 18 | iffalsed 4472 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) |
| 20 | simpr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 = 𝐶) | |
| 21 | 5 | elioored 46001 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 22 | 21 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 ∈ ℝ) |
| 23 | 20, 22 | eqeltrd 2840 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ∈ ℝ) |
| 24 | 11 | simp3d 1150 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 < 𝐵) |
| 25 | 24 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 < 𝐵) |
| 26 | 20, 25 | eqbrtrd 5101 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 < 𝐵) |
| 27 | 23, 26 | ltned 11280 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐵) |
| 28 | 27 | neneqd 2940 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐵) |
| 29 | 28 | iffalsed 4472 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥)) |
| 30 | 20 | fveq2d 6838 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → (𝐹‘𝑥) = (𝐹‘𝐶)) |
| 31 | 19, 29, 30 | 3eqtrd 2779 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝐶)) |
| 32 | ioossicc 13384 | . . 3 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
| 33 | 32, 5 | sselid 3920 | . 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
| 34 | cncfioobdlem.f | . . 3 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶𝑉) | |
| 35 | 34, 5 | ffvelcdmd 7033 | . 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑉) |
| 36 | 2, 31, 33, 35 | fvmptd 6950 | 1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝐹‘𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ifcif 4461 class class class wbr 5079 ↦ cmpt 5160 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 ℝcr 11035 ℝ*cxr 11176 < clt 11177 (,)cioo 13296 [,]cicc 13299 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-pre-lttri 11110 ax-pre-lttrn 11111 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-1st 7938 df-2nd 7939 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-ioo 13300 df-icc 13303 |
| This theorem is referenced by: cncfioobd 46347 |
| Copyright terms: Public domain | W3C validator |