| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oprpiece1res1 | Structured version Visualization version GIF version | ||
| Description: Restriction to the first part of a piecewise defined function. (Contributed by Jeff Madsen, 11-Jun-2010.) (Proof shortened by Mario Carneiro, 3-Sep-2015.) |
| Ref | Expression |
|---|---|
| oprpiece1.1 | ⊢ 𝐴 ∈ ℝ |
| oprpiece1.2 | ⊢ 𝐵 ∈ ℝ |
| oprpiece1.3 | ⊢ 𝐴 ≤ 𝐵 |
| oprpiece1.4 | ⊢ 𝑅 ∈ V |
| oprpiece1.5 | ⊢ 𝑆 ∈ V |
| oprpiece1.6 | ⊢ 𝐾 ∈ (𝐴[,]𝐵) |
| oprpiece1.7 | ⊢ 𝐹 = (𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
| oprpiece1.8 | ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) |
| Ref | Expression |
|---|---|
| oprpiece1res1 | ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = 𝐺 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oprpiece1.1 | . . . . . 6 ⊢ 𝐴 ∈ ℝ | |
| 2 | 1 | rexri 11405 | . . . . 5 ⊢ 𝐴 ∈ ℝ* |
| 3 | oprpiece1.2 | . . . . . 6 ⊢ 𝐵 ∈ ℝ | |
| 4 | 3 | rexri 11405 | . . . . 5 ⊢ 𝐵 ∈ ℝ* |
| 5 | oprpiece1.3 | . . . . 5 ⊢ 𝐴 ≤ 𝐵 | |
| 6 | lbicc2 13634 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
| 7 | 2, 4, 5, 6 | mp3an 1493 | . . . 4 ⊢ 𝐴 ∈ (𝐴[,]𝐵) |
| 8 | oprpiece1.6 | . . . 4 ⊢ 𝐾 ∈ (𝐴[,]𝐵) | |
| 9 | iccss2 13587 | . . . 4 ⊢ ((𝐴 ∈ (𝐴[,]𝐵) ∧ 𝐾 ∈ (𝐴[,]𝐵)) → (𝐴[,]𝐾) ⊆ (𝐴[,]𝐵)) | |
| 10 | 7, 8, 9 | mp2an 705 | . . 3 ⊢ (𝐴[,]𝐾) ⊆ (𝐴[,]𝐵) |
| 11 | ssid 3934 | . . 3 ⊢ 𝐶 ⊆ 𝐶 | |
| 12 | resmpo 7570 | . . 3 ⊢ (((𝐴[,]𝐾) ⊆ (𝐴[,]𝐵) ∧ 𝐶 ⊆ 𝐶) → ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))) | |
| 13 | 10, 11, 12 | mp2an 705 | . 2 ⊢ ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
| 14 | oprpiece1.7 | . . 3 ⊢ 𝐹 = (𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) | |
| 15 | 14 | reseq1i 5981 | . 2 ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) |
| 16 | oprpiece1.8 | . . 3 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) | |
| 17 | eliccxr 13605 | . . . . . . . 8 ⊢ (𝐾 ∈ (𝐴[,]𝐵) → 𝐾 ∈ ℝ*) | |
| 18 | 8, 17 | ax-mp 5 | . . . . . . 7 ⊢ 𝐾 ∈ ℝ* |
| 19 | iccleub 13571 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐾 ∈ ℝ* ∧ 𝑥 ∈ (𝐴[,]𝐾)) → 𝑥 ≤ 𝐾) | |
| 20 | 2, 18, 19 | mp3an12 1483 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴[,]𝐾) → 𝑥 ≤ 𝐾) |
| 21 | 20 | iftrued 4492 | . . . . 5 ⊢ (𝑥 ∈ (𝐴[,]𝐾) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑅) |
| 22 | 21 | adantr 486 | . . . 4 ⊢ ((𝑥 ∈ (𝐴[,]𝐾) ∧ 𝑦 ∈ 𝐶) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑅) |
| 23 | 22 | mpoeq3ia 7528 | . . 3 ⊢ (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) |
| 24 | 16, 23 | eqtr4i 2792 | . 2 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
| 25 | 13, 15, 24 | 3eqtr4i 2799 | 1 ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = 𝐺 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1572 ∈ wcel 2150 Vcvv 3453 ⊆ wss 3899 ifcif 4484 class class class wbr 5107 × cxp 5655 ↾ cres 5659 (class class class)co 7450 ∈ cmpo 7452 ℝcr 11237 ℝ*cxr 11380 ≤ cle 11382 [,]cicc 13518 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-pre-lttri 11312 ax-pre-lttrn 11313 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-po 5565 df-so 5566 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-1st 8034 df-2nd 8035 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-icc 13522 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |