MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  oprpiece1res2 Structured version   Visualization version   GIF version

Theorem oprpiece1res2 25330
Description: Restriction to the second part of a piecewise defined function. (Contributed by Jeff Madsen, 11-Jun-2010.) (Proof shortened by Mario Carneiro, 3-Sep-2015.)
Hypotheses
Ref Expression
oprpiece1.1 𝐴 ∈ ℝ
oprpiece1.2 𝐵 ∈ ℝ
oprpiece1.3 𝐴 ≤ 𝐵
oprpiece1.4 𝑅 ∈ V
oprpiece1.5 𝑆 ∈ V
oprpiece1.6 𝐾 ∈ (𝐴[,]𝐵)
oprpiece1.7 𝐹 = (𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))
oprpiece1.9 (𝑥 = 𝐾 → 𝑅 = 𝑃)
oprpiece1.10 (𝑥 = 𝐾 → 𝑆 = 𝑄)
oprpiece1.11 (𝑦 ∈ 𝐶 → 𝑃 = 𝑄)
oprpiece1.12 𝐺 = (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ 𝑆)
Assertion
Ref Expression
oprpiece1res2 (𝐹 ↾ ((𝐾[,]𝐵) × 𝐶)) = 𝐺
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐾,𝑦   𝑥,𝑃   𝑥,𝑄
Allowed substitution hints:   𝑃(𝑦)   𝑄(𝑦)   𝑅(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐺(𝑥, 𝑦)

Proof of Theorem oprpiece1res2
StepHypRef Expression
1 oprpiece1.6 . . . 4 𝐾 ∈ (𝐴[,]𝐵)
2 oprpiece1.1 . . . . . 6 𝐴 ∈ ℝ
32rexri 11405 . . . . 5 𝐴 ∈ ℝ*
4 oprpiece1.2 . . . . . 6 𝐵 ∈ ℝ
54rexri 11405 . . . . 5 𝐵 ∈ ℝ*
6 oprpiece1.3 . . . . 5 𝐴 ≤ 𝐵
7 ubicc2 13635 . . . . 5 ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
83, 5, 6, 7mp3an 1493 . . . 4 𝐵 ∈ (𝐴[,]𝐵)
9 iccss2 13587 . . . 4 ((𝐾 ∈ (𝐴[,]𝐵) ∧ 𝐵 ∈ (𝐴[,]𝐵)) → (𝐾[,]𝐵) ⊆ (𝐴[,]𝐵))
101, 8, 9mp2an 705 . . 3 (𝐾[,]𝐵) ⊆ (𝐴[,]𝐵)
11 ssid 3934 . . 3 𝐶 ⊆ 𝐶
12 resmpo 7570 . . 3 (((𝐾[,]𝐵) ⊆ (𝐴[,]𝐵) ∧ 𝐶 ⊆ 𝐶) → ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐾[,]𝐵) × 𝐶)) = (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)))
1310, 11, 12mp2an 705 . 2 ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐾[,]𝐵) × 𝐶)) = (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))
14 oprpiece1.7 . . 3 𝐹 = (𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))
1514reseq1i 5981 . 2 (𝐹 ↾ ((𝐾[,]𝐵) × 𝐶)) = ((𝑥 ∈ (𝐴[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) ↾ ((𝐾[,]𝐵) × 𝐶))
16 oprpiece1.12 . . 3 𝐺 = (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ 𝑆)
17 oprpiece1.11 . . . . . . 7 (𝑦 ∈ 𝐶 → 𝑃 = 𝑄)
1817ad2antlr 740 . . . . . 6 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑃 = 𝑄)
19 simpr 490 . . . . . . . 8 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑥 ≤ 𝐾)
202, 4elicc2i 13582 . . . . . . . . . . . . 13 (𝐾 ∈ (𝐴[,]𝐵) ↔ (𝐾 ∈ ℝ ∧ 𝐴 ≤ 𝐾 ∧ 𝐾 ≤ 𝐵))
2120simp1bi 1164 . . . . . . . . . . . 12 (𝐾 ∈ (𝐴[,]𝐵) → 𝐾 ∈ ℝ)
221, 21ax-mp 5 . . . . . . . . . . 11 𝐾 ∈ ℝ
2322, 4elicc2i 13582 . . . . . . . . . 10 (𝑥 ∈ (𝐾[,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐾 ≤ 𝑥 ∧ 𝑥 ≤ 𝐵))
2423simp2bi 1165 . . . . . . . . 9 (𝑥 ∈ (𝐾[,]𝐵) → 𝐾 ≤ 𝑥)
2524ad2antrr 739 . . . . . . . 8 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝐾 ≤ 𝑥)
2623simp1bi 1164 . . . . . . . . . 10 (𝑥 ∈ (𝐾[,]𝐵) → 𝑥 ∈ ℝ)
2726ad2antrr 739 . . . . . . . . 9 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑥 ∈ ℝ)
28 letri3 11433 . . . . . . . . 9 ((𝑥 ∈ ℝ ∧ 𝐾 ∈ ℝ) → (𝑥 = 𝐾 ↔ (𝑥 ≤ 𝐾 ∧ 𝐾 ≤ 𝑥)))
2927, 22, 28sylancl 598 . . . . . . . 8 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → (𝑥 = 𝐾 ↔ (𝑥 ≤ 𝐾 ∧ 𝐾 ≤ 𝑥)))
3019, 25, 29mpbir2and 726 . . . . . . 7 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑥 = 𝐾)
31 oprpiece1.9 . . . . . . 7 (𝑥 = 𝐾 → 𝑅 = 𝑃)
3230, 31syl 18 . . . . . 6 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑅 = 𝑃)
33 oprpiece1.10 . . . . . . 7 (𝑥 = 𝐾 → 𝑆 = 𝑄)
3430, 33syl 18 . . . . . 6 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑆 = 𝑄)
3518, 32, 343eqtr4d 2811 . . . . 5 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ≤ 𝐾) → 𝑅 = 𝑆)
36 eqidd 2767 . . . . 5 (((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) ∧ ¬ 𝑥 ≤ 𝐾) → 𝑆 = 𝑆)
3735, 36ifeqda 4521 . . . 4 ((𝑥 ∈ (𝐾[,]𝐵) ∧ 𝑦 ∈ 𝐶) → if(𝑥 ≤ 𝐾, 𝑅, 𝑆) = 𝑆)
3837mpoeq3ia 7528 . . 3 (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆)) = (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ 𝑆)
3916, 38eqtr4i 2792 . 2 𝐺 = (𝑥 ∈ (𝐾[,]𝐵), 𝑦 ∈ 𝐶 ↦ if(𝑥 ≤ 𝐾, 𝑅, 𝑆))
4013, 15, 393eqtr4i 2799 1 (𝐹 ↾ ((𝐾[,]𝐵) × 𝐶)) = 𝐺
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = 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