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

Theorem mbfposb 24235
 Description: A function is measurable iff its positive and negative parts are measurable. (Contributed by Mario Carneiro, 11-Aug-2014.)
Hypothesis
Ref Expression
mbfpos.1 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)
Assertion
Ref Expression
mbfposb (𝜑 → ((𝑥𝐴𝐵) ∈ MblFn ↔ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)))
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem mbfposb
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nfcv 2974 . . . . . . . . 9 𝑥0
2 nfcv 2974 . . . . . . . . 9 𝑥
3 nffvmpt1 6654 . . . . . . . . 9 𝑥((𝑥𝐴𝐵)‘𝑦)
41, 2, 3nfbr 5086 . . . . . . . 8 𝑥0 ≤ ((𝑥𝐴𝐵)‘𝑦)
54, 3, 1nfif 4469 . . . . . . 7 𝑥if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)
6 nfcv 2974 . . . . . . 7 𝑦if(0 ≤ ((𝑥𝐴𝐵)‘𝑥), ((𝑥𝐴𝐵)‘𝑥), 0)
7 fveq2 6643 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝑥𝐴𝐵)‘𝑦) = ((𝑥𝐴𝐵)‘𝑥))
87breq2d 5051 . . . . . . . 8 (𝑦 = 𝑥 → (0 ≤ ((𝑥𝐴𝐵)‘𝑦) ↔ 0 ≤ ((𝑥𝐴𝐵)‘𝑥)))
98, 7ifbieq1d 4463 . . . . . . 7 (𝑦 = 𝑥 → if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0) = if(0 ≤ ((𝑥𝐴𝐵)‘𝑥), ((𝑥𝐴𝐵)‘𝑥), 0))
105, 6, 9cbvmpt 5140 . . . . . 6 (𝑦𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑥), ((𝑥𝐴𝐵)‘𝑥), 0))
11 simpr 488 . . . . . . . . . 10 ((𝜑𝑥𝐴) → 𝑥𝐴)
12 mbfpos.1 . . . . . . . . . 10 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)
13 eqid 2821 . . . . . . . . . . 11 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
1413fvmpt2 6752 . . . . . . . . . 10 ((𝑥𝐴𝐵 ∈ ℝ) → ((𝑥𝐴𝐵)‘𝑥) = 𝐵)
1511, 12, 14syl2anc 587 . . . . . . . . 9 ((𝜑𝑥𝐴) → ((𝑥𝐴𝐵)‘𝑥) = 𝐵)
1615breq2d 5051 . . . . . . . 8 ((𝜑𝑥𝐴) → (0 ≤ ((𝑥𝐴𝐵)‘𝑥) ↔ 0 ≤ 𝐵))
1716, 15ifbieq1d 4463 . . . . . . 7 ((𝜑𝑥𝐴) → if(0 ≤ ((𝑥𝐴𝐵)‘𝑥), ((𝑥𝐴𝐵)‘𝑥), 0) = if(0 ≤ 𝐵, 𝐵, 0))
1817mpteq2dva 5134 . . . . . 6 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑥), ((𝑥𝐴𝐵)‘𝑥), 0)) = (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
1910, 18syl5eq 2868 . . . . 5 (𝜑 → (𝑦𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
2019adantr 484 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑦𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
2112fmpttd 6852 . . . . . . 7 (𝜑 → (𝑥𝐴𝐵):𝐴⟶ℝ)
2221adantr 484 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥𝐴𝐵):𝐴⟶ℝ)
2322ffvelrnda 6824 . . . . 5 (((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) ∧ 𝑦𝐴) → ((𝑥𝐴𝐵)‘𝑦) ∈ ℝ)
24 nfcv 2974 . . . . . . . . 9 𝑦((𝑥𝐴𝐵)‘𝑥)
253, 24, 7cbvmpt 5140 . . . . . . . 8 (𝑦𝐴 ↦ ((𝑥𝐴𝐵)‘𝑦)) = (𝑥𝐴 ↦ ((𝑥𝐴𝐵)‘𝑥))
2615mpteq2dva 5134 . . . . . . . 8 (𝜑 → (𝑥𝐴 ↦ ((𝑥𝐴𝐵)‘𝑥)) = (𝑥𝐴𝐵))
2725, 26syl5eq 2868 . . . . . . 7 (𝜑 → (𝑦𝐴 ↦ ((𝑥𝐴𝐵)‘𝑦)) = (𝑥𝐴𝐵))
2827eleq1d 2896 . . . . . 6 (𝜑 → ((𝑦𝐴 ↦ ((𝑥𝐴𝐵)‘𝑦)) ∈ MblFn ↔ (𝑥𝐴𝐵) ∈ MblFn))
2928biimpar 481 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑦𝐴 ↦ ((𝑥𝐴𝐵)‘𝑦)) ∈ MblFn)
3023, 29mbfpos 24233 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑦𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)) ∈ MblFn)
3120, 30eqeltrrd 2913 . . 3 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)
323nfneg 10859 . . . . . . . . 9 𝑥-((𝑥𝐴𝐵)‘𝑦)
331, 2, 32nfbr 5086 . . . . . . . 8 𝑥0 ≤ -((𝑥𝐴𝐵)‘𝑦)
3433, 32, 1nfif 4469 . . . . . . 7 𝑥if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)
35 nfcv 2974 . . . . . . 7 𝑦if(0 ≤ -((𝑥𝐴𝐵)‘𝑥), -((𝑥𝐴𝐵)‘𝑥), 0)
367negeqd 10857 . . . . . . . . 9 (𝑦 = 𝑥 → -((𝑥𝐴𝐵)‘𝑦) = -((𝑥𝐴𝐵)‘𝑥))
3736breq2d 5051 . . . . . . . 8 (𝑦 = 𝑥 → (0 ≤ -((𝑥𝐴𝐵)‘𝑦) ↔ 0 ≤ -((𝑥𝐴𝐵)‘𝑥)))
3837, 36ifbieq1d 4463 . . . . . . 7 (𝑦 = 𝑥 → if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0) = if(0 ≤ -((𝑥𝐴𝐵)‘𝑥), -((𝑥𝐴𝐵)‘𝑥), 0))
3934, 35, 38cbvmpt 5140 . . . . . 6 (𝑦𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑥), -((𝑥𝐴𝐵)‘𝑥), 0))
4015negeqd 10857 . . . . . . . . 9 ((𝜑𝑥𝐴) → -((𝑥𝐴𝐵)‘𝑥) = -𝐵)
4140breq2d 5051 . . . . . . . 8 ((𝜑𝑥𝐴) → (0 ≤ -((𝑥𝐴𝐵)‘𝑥) ↔ 0 ≤ -𝐵))
4241, 40ifbieq1d 4463 . . . . . . 7 ((𝜑𝑥𝐴) → if(0 ≤ -((𝑥𝐴𝐵)‘𝑥), -((𝑥𝐴𝐵)‘𝑥), 0) = if(0 ≤ -𝐵, -𝐵, 0))
4342mpteq2dva 5134 . . . . . 6 (𝜑 → (𝑥𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑥), -((𝑥𝐴𝐵)‘𝑥), 0)) = (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
4439, 43syl5eq 2868 . . . . 5 (𝜑 → (𝑦𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
4544adantr 484 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑦𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
4623renegcld 11044 . . . . 5 (((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) ∧ 𝑦𝐴) → -((𝑥𝐴𝐵)‘𝑦) ∈ ℝ)
4723, 29mbfneg 24232 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑦𝐴 ↦ -((𝑥𝐴𝐵)‘𝑦)) ∈ MblFn)
4846, 47mbfpos 24233 . . . 4 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑦𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)) ∈ MblFn)
4945, 48eqeltrrd 2913 . . 3 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)
5031, 49jca 515 . 2 ((𝜑 ∧ (𝑥𝐴𝐵) ∈ MblFn) → ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn))
5127adantr 484 . . 3 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦𝐴 ↦ ((𝑥𝐴𝐵)‘𝑦)) = (𝑥𝐴𝐵))
5221ffvelrnda 6824 . . . . 5 ((𝜑𝑦𝐴) → ((𝑥𝐴𝐵)‘𝑦) ∈ ℝ)
5352adantlr 714 . . . 4 (((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) ∧ 𝑦𝐴) → ((𝑥𝐴𝐵)‘𝑦) ∈ ℝ)
5419adantr 484 . . . . 5 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
55 simprl 770 . . . . 5 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)
5654, 55eqeltrd 2912 . . . 4 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦𝐴 ↦ if(0 ≤ ((𝑥𝐴𝐵)‘𝑦), ((𝑥𝐴𝐵)‘𝑦), 0)) ∈ MblFn)
5744adantr 484 . . . . 5 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)) = (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
58 simprr 772 . . . . 5 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)
5957, 58eqeltrd 2912 . . . 4 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦𝐴 ↦ if(0 ≤ -((𝑥𝐴𝐵)‘𝑦), -((𝑥𝐴𝐵)‘𝑦), 0)) ∈ MblFn)
6053, 56, 59mbfposr 24234 . . 3 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦𝐴 ↦ ((𝑥𝐴𝐵)‘𝑦)) ∈ MblFn)
6151, 60eqeltrrd 2913 . 2 ((𝜑 ∧ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑥𝐴𝐵) ∈ MblFn)
6250, 61impbida 800 1 (𝜑 → ((𝑥𝐴𝐵) ∈ MblFn ↔ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ifcif 4440   class class class wbr 5039   ↦ cmpt 5119  ⟶wf 6324  ‘cfv 6328  ℝcr 10513  0cc0 10514   ≤ cle 10653  -cneg 10848  MblFncmbf 24196 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-rep 5163  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436  ax-inf2 9080  ax-cnex 10570  ax-resscn 10571  ax-1cn 10572  ax-icn 10573  ax-addcl 10574  ax-addrcl 10575  ax-mulcl 10576  ax-mulrcl 10577  ax-mulcom 10578  ax-addass 10579  ax-mulass 10580  ax-distr 10581  ax-i2m1 10582  ax-1ne0 10583  ax-1rid 10584  ax-rnegex 10585  ax-rrecex 10586  ax-cnre 10587  ax-pre-lttri 10588  ax-pre-lttrn 10589  ax-pre-ltadd 10590  ax-pre-mulgt0 10591  ax-pre-sup 10592 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-nel 3112  df-ral 3131  df-rex 3132  df-reu 3133  df-rmo 3134  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-tp 4545  df-op 4547  df-uni 4812  df-int 4850  df-iun 4894  df-br 5040  df-opab 5102  df-mpt 5120  df-tr 5146  df-id 5433  df-eprel 5438  df-po 5447  df-so 5448  df-fr 5487  df-se 5488  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6121  df-ord 6167  df-on 6168  df-lim 6169  df-suc 6170  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-isom 6337  df-riota 7088  df-ov 7133  df-oprab 7134  df-mpo 7135  df-of 7384  df-om 7556  df-1st 7664  df-2nd 7665  df-wrecs 7922  df-recs 7983  df-rdg 8021  df-1o 8077  df-2o 8078  df-oadd 8081  df-er 8264  df-map 8383  df-pm 8384  df-en 8485  df-dom 8486  df-sdom 8487  df-fin 8488  df-sup 8882  df-inf 8883  df-oi 8950  df-dju 9306  df-card 9344  df-pnf 10654  df-mnf 10655  df-xr 10656  df-ltxr 10657  df-le 10658  df-sub 10849  df-neg 10850  df-div 11275  df-nn 11616  df-2 11678  df-3 11679  df-n0 11876  df-z 11960  df-uz 12222  df-q 12327  df-rp 12368  df-xadd 12486  df-ioo 12720  df-ico 12722  df-icc 12723  df-fz 12876  df-fzo 13017  df-fl 13145  df-seq 13353  df-exp 13414  df-hash 13675  df-cj 14437  df-re 14438  df-im 14439  df-sqrt 14573  df-abs 14574  df-clim 14824  df-sum 15022  df-xmet 20513  df-met 20514  df-ovol 24046  df-vol 24047  df-mbf 24201 This theorem is referenced by:  iblre  24375
 Copyright terms: Public domain W3C validator