![]() |
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 11268 | . . . . 5 ⊢ 𝐴 ∈ ℝ* |
3 | oprpiece1.2 | . . . . . 6 ⊢ 𝐵 ∈ ℝ | |
4 | 3 | rexri 11268 | . . . . 5 ⊢ 𝐵 ∈ ℝ* |
5 | oprpiece1.3 | . . . . 5 ⊢ 𝐴 ≤ 𝐵 | |
6 | lbicc2 13437 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
7 | 2, 4, 5, 6 | mp3an 1462 | . . . 4 ⊢ 𝐴 ∈ (𝐴[,]𝐵) |
8 | oprpiece1.6 | . . . 4 ⊢ 𝐾 ∈ (𝐴[,]𝐵) | |
9 | iccss2 13391 | . . . 4 ⊢ ((𝐴 ∈ (𝐴[,]𝐵) ∧ 𝐾 ∈ (𝐴[,]𝐵)) → (𝐴[,]𝐾) ⊆ (𝐴[,]𝐵)) | |
10 | 7, 8, 9 | mp2an 691 | . . 3 ⊢ (𝐴[,]𝐾) ⊆ (𝐴[,]𝐵) |
11 | ssid 4003 | . . 3 ⊢ 𝐶 ⊆ 𝐶 | |
12 | resmpo 7523 | . . 3 ⊢ (((𝐴[,]𝐾) ⊆ (𝐴[,]𝐵) ∧ 𝐶 ⊆ 𝐶) → ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))) | |
13 | 10, 11, 12 | mp2an 691 | . 2 ⊢ ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
14 | oprpiece1.7 | . . 3 ⊢ 𝐹 = (𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) | |
15 | 14 | reseq1i 5975 | . 2 ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) |
16 | oprpiece1.8 | . . 3 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) | |
17 | eliccxr 13408 | . . . . . . . 8 ⊢ (𝐾 ∈ (𝐴[,]𝐵) → 𝐾 ∈ ℝ*) | |
18 | 8, 17 | ax-mp 5 | . . . . . . 7 ⊢ 𝐾 ∈ ℝ* |
19 | iccleub 13375 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐾 ∈ ℝ* ∧ 𝑥 ∈ (𝐴[,]𝐾)) → 𝑥 ≤ 𝐾) | |
20 | 2, 18, 19 | mp3an12 1452 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴[,]𝐾) → 𝑥 ≤ 𝐾) |
21 | 20 | iftrued 4535 | . . . . 5 ⊢ (𝑥 ∈ (𝐴[,]𝐾) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑅) |
22 | 21 | adantr 482 | . . . 4 ⊢ ((𝑥 ∈ (𝐴[,]𝐾) ∧ 𝑦 ∈ 𝐶) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑅) |
23 | 22 | mpoeq3ia 7482 | . . 3 ⊢ (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) |
24 | 16, 23 | eqtr4i 2764 | . 2 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
25 | 13, 15, 24 | 3eqtr4i 2771 | 1 ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = 𝐺 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1542 ∈ wcel 2107 Vcvv 3475 ⊆ wss 3947 ifcif 4527 class class class wbr 5147 × cxp 5673 ↾ cres 5677 (class class class)co 7404 ∈ cmpo 7406 ℝcr 11105 ℝ*cxr 11243 ≤ cle 11245 [,]cicc 13323 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7720 ax-cnex 11162 ax-resscn 11163 ax-pre-lttri 11180 ax-pre-lttrn 11181 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7407 df-oprab 7408 df-mpo 7409 df-1st 7970 df-2nd 7971 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-icc 13327 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |