![]() |
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 11269 | . . . . 5 ⊢ 𝐴 ∈ ℝ* |
3 | oprpiece1.2 | . . . . . 6 ⊢ 𝐵 ∈ ℝ | |
4 | 3 | rexri 11269 | . . . . 5 ⊢ 𝐵 ∈ ℝ* |
5 | oprpiece1.3 | . . . . 5 ⊢ 𝐴 ≤ 𝐵 | |
6 | lbicc2 13438 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵)) | |
7 | 2, 4, 5, 6 | mp3an 1457 | . . . 4 ⊢ 𝐴 ∈ (𝐴[,]𝐵) |
8 | oprpiece1.6 | . . . 4 ⊢ 𝐾 ∈ (𝐴[,]𝐵) | |
9 | iccss2 13392 | . . . 4 ⊢ ((𝐴 ∈ (𝐴[,]𝐵) ∧ 𝐾 ∈ (𝐴[,]𝐵)) → (𝐴[,]𝐾) ⊆ (𝐴[,]𝐵)) | |
10 | 7, 8, 9 | mp2an 689 | . . 3 ⊢ (𝐴[,]𝐾) ⊆ (𝐴[,]𝐵) |
11 | ssid 3996 | . . 3 ⊢ 𝐶 ⊆ 𝐶 | |
12 | resmpo 7520 | . . 3 ⊢ (((𝐴[,]𝐾) ⊆ (𝐴[,]𝐵) ∧ 𝐶 ⊆ 𝐶) → ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))) | |
13 | 10, 11, 12 | mp2an 689 | . 2 ⊢ ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
14 | oprpiece1.7 | . . 3 ⊢ 𝐹 = (𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) | |
15 | 14 | reseq1i 5967 | . 2 ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐴[,]𝐾) × 𝐶)) |
16 | oprpiece1.8 | . . 3 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) | |
17 | eliccxr 13409 | . . . . . . . 8 ⊢ (𝐾 ∈ (𝐴[,]𝐵) → 𝐾 ∈ ℝ*) | |
18 | 8, 17 | ax-mp 5 | . . . . . . 7 ⊢ 𝐾 ∈ ℝ* |
19 | iccleub 13376 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐾 ∈ ℝ* ∧ 𝑥 ∈ (𝐴[,]𝐾)) → 𝑥 ≤ 𝐾) | |
20 | 2, 18, 19 | mp3an12 1447 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴[,]𝐾) → 𝑥 ≤ 𝐾) |
21 | 20 | iftrued 4528 | . . . . 5 ⊢ (𝑥 ∈ (𝐴[,]𝐾) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑅) |
22 | 21 | adantr 480 | . . . 4 ⊢ ((𝑥 ∈ (𝐴[,]𝐾) ∧ 𝑦 ∈ 𝐶) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑅) |
23 | 22 | mpoeq3ia 7479 | . . 3 ⊢ (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ 𝑅) |
24 | 16, 23 | eqtr4i 2755 | . 2 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐾), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) |
25 | 13, 15, 24 | 3eqtr4i 2762 | 1 ⊢ (𝐹 ↾ ((𝐴[,]𝐾) × 𝐶)) = 𝐺 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2098 Vcvv 3466 ⊆ wss 3940 ifcif 4520 class class class wbr 5138 × cxp 5664 ↾ cres 5668 (class class class)co 7401 ∈ cmpo 7403 ℝcr 11105 ℝ*cxr 11244 ≤ cle 11246 [,]cicc 13324 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11162 ax-resscn 11163 ax-pre-lttri 11180 ax-pre-lttrn 11181 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-id 5564 df-po 5578 df-so 5579 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7404 df-oprab 7405 df-mpo 7406 df-1st 7968 df-2nd 7969 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-icc 13328 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |