| 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 11247 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 7 | cncfioobdlem.b | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 8 | 7 | rexrd 11247 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| 9 | elioo2 13404 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 10 | 6, 8, 9 | syl2anc 595 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 11 | 5, 10 | mpbid 235 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) |
| 12 | 11 | simp2d 1159 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐶) |
| 13 | 12 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝐶) |
| 14 | eqcom 2772 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 ↔ 𝐶 = 𝑥) | |
| 15 | 14 | bilani 509 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 = 𝑥) |
| 16 | 13, 15 | breqtrd 5131 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝑥) |
| 17 | 4, 16 | gtned 11333 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐴) |
| 18 | 17 | neneqd 2965 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐴) |
| 19 | 18 | iffalsed 4494 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) |
| 20 | simpr 489 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 = 𝐶) | |
| 21 | 5 | elioored 46123 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 22 | 21 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 ∈ ℝ) |
| 23 | 20, 22 | eqeltrd 2865 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ∈ ℝ) |
| 24 | 11 | simp3d 1160 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 < 𝐵) |
| 25 | 24 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 < 𝐵) |
| 26 | 20, 25 | eqbrtrd 5127 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 < 𝐵) |
| 27 | 23, 26 | ltned 11334 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐵) |
| 28 | 27 | neneqd 2965 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐵) |
| 29 | 28 | iffalsed 4494 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥)) |
| 30 | 20 | fveq2d 6875 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → (𝐹‘𝑥) = (𝐹‘𝐶)) |
| 31 | 19, 29, 30 | 3eqtrd 2804 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝐶)) |
| 32 | ioossicc 13451 | . . 3 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
| 33 | 32, 5 | sselid 3937 | . 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
| 34 | cncfioobdlem.f | . . 3 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶𝑉) | |
| 35 | 34, 5 | ffvelcdmd 7070 | . 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑉) |
| 36 | 2, 31, 33, 35 | fvmptd 6987 | 1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝐹‘𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ifcif 4483 class class class wbr 5105 ↦ cmpt 5186 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 ℝcr 11087 ℝ*cxr 11230 < clt 11231 (,)cioo 13363 [,]cicc 13366 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-pre-lttri 11162 ax-pre-lttrn 11163 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-po 5560 df-so 5561 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-1st 7974 df-2nd 7975 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-ioo 13367 df-icc 13370 |
| This theorem is referenced by: cncfioobd 46469 |
| Copyright terms: Public domain | W3C validator |