Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  carsgval Structured version   Visualization version   GIF version

Theorem carsgval 35002
Description: Value of the Caratheodory sigma-Algebra construction function. (Contributed by Thierry Arnoux, 17-May-2020.)
Hypotheses
Ref Expression
carsgval.1 (𝜑 → 𝑂 ∈ 𝑉)
carsgval.2 (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞))
Assertion
Ref Expression
carsgval (𝜑 → (toCaraSiga‘𝑀) = {𝑎 ∈ 𝒫 𝑂 ∣ ∀𝑒 ∈ 𝒫 𝑂((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)})
Distinct variable groups:   𝑀,𝑎,𝑒   𝑂,𝑎,𝑒   𝜑,𝑎,𝑒
Allowed substitution hints:   𝑉(𝑒, 𝑎)

Proof of Theorem carsgval
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 df-carsg 35001 . 2 toCaraSiga = (𝑚 ∈ V ↦ {𝑎 ∈ 𝒫 ∪ dom 𝑚 ∣ ∀𝑒 ∈ 𝒫 ∪ dom 𝑚((𝑚‘(𝑒 ∩ 𝑎)) +e (𝑚‘(𝑒 ∖ 𝑎))) = (𝑚‘𝑒)})
2 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
32dmeqd 5893 . . . . . . 7 ((𝜑 ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
4 carsgval.2 . . . . . . . . 9 (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞))
54fdmd 6739 . . . . . . . 8 (𝜑 → dom 𝑀 = 𝒫 𝑂)
65adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑚 = 𝑀) → dom 𝑀 = 𝒫 𝑂)
73, 6eqtrd 2798 . . . . . 6 ((𝜑 ∧ 𝑚 = 𝑀) → dom 𝑚 = 𝒫 𝑂)
87unieqd 4883 . . . . 5 ((𝜑 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ 𝒫 𝑂)
9 unipw 5422 . . . . 5 ∪ 𝒫 𝑂 = 𝑂
108, 9eqtrdi 2814 . . . 4 ((𝜑 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = 𝑂)
1110pweqd 4577 . . 3 ((𝜑 ∧ 𝑚 = 𝑀) → 𝒫 ∪ dom 𝑚 = 𝒫 𝑂)
12 fveq1 6904 . . . . . . 7 (𝑚 = 𝑀 → (𝑚‘(𝑒 ∩ 𝑎)) = (𝑀‘(𝑒 ∩ 𝑎)))
13 fveq1 6904 . . . . . . 7 (𝑚 = 𝑀 → (𝑚‘(𝑒 ∖ 𝑎)) = (𝑀‘(𝑒 ∖ 𝑎)))
1412, 13oveq12d 7458 . . . . . 6 (𝑚 = 𝑀 → ((𝑚‘(𝑒 ∩ 𝑎)) +e (𝑚‘(𝑒 ∖ 𝑎))) = ((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))))
15 fveq1 6904 . . . . . 6 (𝑚 = 𝑀 → (𝑚‘𝑒) = (𝑀‘𝑒))
1614, 15eqeq12d 2779 . . . . 5 (𝑚 = 𝑀 → (((𝑚‘(𝑒 ∩ 𝑎)) +e (𝑚‘(𝑒 ∖ 𝑎))) = (𝑚‘𝑒) ↔ ((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)))
1716adantl 487 . . . 4 ((𝜑 ∧ 𝑚 = 𝑀) → (((𝑚‘(𝑒 ∩ 𝑎)) +e (𝑚‘(𝑒 ∖ 𝑎))) = (𝑚‘𝑒) ↔ ((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)))
1811, 17raleqbidv 3338 . . 3 ((𝜑 ∧ 𝑚 = 𝑀) → (∀𝑒 ∈ 𝒫 ∪ dom 𝑚((𝑚‘(𝑒 ∩ 𝑎)) +e (𝑚‘(𝑒 ∖ 𝑎))) = (𝑚‘𝑒) ↔ ∀𝑒 ∈ 𝒫 𝑂((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)))
1911, 18rabeqbidv 3433 . 2 ((𝜑 ∧ 𝑚 = 𝑀) → {𝑎 ∈ 𝒫 ∪ dom 𝑚 ∣ ∀𝑒 ∈ 𝒫 ∪ dom 𝑚((𝑚‘(𝑒 ∩ 𝑎)) +e (𝑚‘(𝑒 ∖ 𝑎))) = (𝑚‘𝑒)} = {𝑎 ∈ 𝒫 𝑂 ∣ ∀𝑒 ∈ 𝒫 𝑂((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)})
20 carsgval.1 . . . 4 (𝜑 → 𝑂 ∈ 𝑉)
2120pwexd 5345 . . 3 (𝜑 → 𝒫 𝑂 ∈ V)
224, 21fexd 7253 . 2 (𝜑 → 𝑀 ∈ V)
23 pwexg 5344 . . 3 (𝑂 ∈ 𝑉 → 𝒫 𝑂 ∈ V)
24 rabexg 5303 . . 3 (𝒫 𝑂 ∈ V → {𝑎 ∈ 𝒫 𝑂 ∣ ∀𝑒 ∈ 𝒫 𝑂((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)} ∈ V)
2520, 23, 243syl 19 . 2 (𝜑 → {𝑎 ∈ 𝒫 𝑂 ∣ ∀𝑒 ∈ 𝒫 𝑂((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)} ∈ V)
261, 19, 22, 25fvmptd2 7022 1 (𝜑 → (toCaraSiga‘𝑀) = {𝑎 ∈ 𝒫 𝑂 ∣ ∀𝑒 ∈ 𝒫 𝑂((𝑀‘(𝑒 ∩ 𝑎)) +e (𝑀‘(𝑒 ∖ 𝑎))) = (𝑀‘𝑒)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4870  dom cdm 5655  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440  0cc0 11224  +∞cpnf 11364   +e cxad 13263  [,]cicc 13503  toCaraSigaccarsg 35000
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-carsg 35001
This theorem is used by:  carsgcl  35003  elcarsg  35004
  Copyright terms: Public domain W3C validator