| 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 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 ∈ ℝ) |
| 5 | cncfioobdlem.c | . . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵)) | |
| 6 | 3 | rexrd 11287 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| 7 | cncfioobdlem.b | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 8 | 7 | rexrd 11287 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| 9 | elioo2 13443 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) | |
| 10 | 6, 8, 9 | syl2anc 596 | . . . . . . . . . 10 ⊢ (𝜑 → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵))) |
| 11 | 5, 10 | mpbid 235 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 < 𝐵)) |
| 12 | 11 | simp2d 1161 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 < 𝐶) |
| 13 | 12 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝐶) |
| 14 | eqcom 2769 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 ↔ 𝐶 = 𝑥) | |
| 15 | 14 | bilani 510 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 = 𝑥) |
| 16 | 13, 15 | breqtrd 5135 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐴 < 𝑥) |
| 17 | 4, 16 | gtned 11373 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐴) |
| 18 | 17 | neneqd 2962 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐴) |
| 19 | 18 | iffalsed 4496 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) |
| 20 | simpr 490 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 = 𝐶) | |
| 21 | 5 | elioored 46387 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 22 | 21 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 ∈ ℝ) |
| 23 | 20, 22 | eqeltrd 2862 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ∈ ℝ) |
| 24 | 11 | simp3d 1162 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 < 𝐵) |
| 25 | 24 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐶 < 𝐵) |
| 26 | 20, 25 | eqbrtrd 5131 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 < 𝐵) |
| 27 | 23, 26 | ltned 11374 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝑥 ≠ 𝐵) |
| 28 | 27 | neneqd 2962 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → ¬ 𝑥 = 𝐵) |
| 29 | 28 | iffalsed 4496 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥)) |
| 30 | 20 | fveq2d 6886 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → (𝐹‘𝑥) = (𝐹‘𝐶)) |
| 31 | 19, 29, 30 | 3eqtrd 2801 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝐶)) |
| 32 | ioossicc 13490 | . . 3 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) | |
| 33 | 32, 5 | sselid 3932 | . 2 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
| 34 | cncfioobdlem.f | . . 3 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶𝑉) | |
| 35 | 34, 5 | ffvelcdmd 7082 | . 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑉) |
| 36 | 2, 31, 33, 35 | fvmptd 6998 | 1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝐹‘𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ifcif 4485 class class class wbr 5107 ↦ cmpt 5190 ⟶wf 6533 ‘cfv 6537 (class class class)co 7417 ℝcr 11127 ℝ*cxr 11270 < clt 11271 (,)cioo 13402 [,]cicc 13405 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-pre-lttri 11202 ax-pre-lttrn 11203 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-ioo 13406 df-icc 13409 |
| This theorem is used by: cncfioobd 46733 |
| Copyright terms: Public domain | W3C validator |