| 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 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 ∈ ℝ) |
| 5 | cncfioobdlem.c | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵)) | |
| 6 | 3 | rexrd 11229 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 7 | cncfioobdlem.b | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 8 | 7 | rexrd 11229 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| 9 | elioo2 13387 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 10 | 6, 8, 9 | syl2anc 593 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 11 | 5, 10 | mpbid 234 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) |
| 12 | 11 | simp2d 1155 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐶) |
| 13 | 12 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝐶) |
| 14 | eqcom 2768 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 ↔ 𝐶 = 𝑥) | |
| 15 | 14 | bilani 508 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 = 𝑥) |
| 16 | 13, 15 | breqtrd 5125 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝑥) |
| 17 | 4, 16 | gtned 11315 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐴) |
| 18 | 17 | neneqd 2961 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐴) |
| 19 | 18 | iffalsed 4490 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) |
| 20 | simpr 488 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 = 𝐶) | |
| 21 | 5 | elioored 46089 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 22 | 21 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 ∈ ℝ) |
| 23 | 20, 22 | eqeltrd 2861 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ∈ ℝ) |
| 24 | 11 | simp3d 1156 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 < 𝐵) |
| 25 | 24 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 < 𝐵) |
| 26 | 20, 25 | eqbrtrd 5121 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 < 𝐵) |
| 27 | 23, 26 | ltned 11316 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐵) |
| 28 | 27 | neneqd 2961 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐵) |
| 29 | 28 | iffalsed 4490 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥)) |
| 30 | 20 | fveq2d 6867 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → (𝐹‘𝑥) = (𝐹‘𝐶)) |
| 31 | 19, 29, 30 | 3eqtrd 2800 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝐶)) |
| 32 | ioossicc 13434 | . . 3 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
| 33 | 32, 5 | sselid 3934 | . 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
| 34 | cncfioobdlem.f | . . 3 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶𝑉) | |
| 35 | 34, 5 | ffvelcdmd 7062 | . 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑉) |
| 36 | 2, 31, 33, 35 | fvmptd 6979 | 1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝐹‘𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ifcif 4479 class class class wbr 5099 ↦ cmpt 5180 ⟶wf 6513 ‘cfv 6517 (class class class)co 7392 ℝcr 11069 ℝ*cxr 11212 < clt 11213 (,)cioo 13346 [,]cicc 13349 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-pre-lttri 11144 ax-pre-lttrn 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-po 5553 df-so 5554 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-1st 7966 df-2nd 7967 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-ioo 13350 df-icc 13353 |
| This theorem is referenced by: cncfioobd 46435 |
| Copyright terms: Public domain | W3C validator |