Theorem braew 34921

Description: 'almost everywhere' relation for a measure 𝑀 and a property 𝜑 (Contributed by Thierry Arnoux, 20-Oct-2017.)

Hypothesis

Ref	Expression
braew.1	⊢ ∪ dom 𝑀 = 𝑂

Assertion

Ref	Expression
braew	⊢ (𝑀 ∈ ∪ ran measures → ({𝑥 ∈ 𝑂 ∣ 𝜑}a.e.𝑀 ↔ (𝑀‘{𝑥 ∈ 𝑂 ∣ ¬ 𝜑}) = 0))

Distinct variable group:   𝑥,𝑂

Allowed substitution hints:   𝜑(𝑥)   𝑀(𝑥)

Proof of Theorem braew

Dummy variables 𝑚 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		braew.1	. . . . 5 ⊢ ∪ dom 𝑀 = 𝑂
2		dmexg 7913	. . . . . 6 ⊢ (𝑀 ∈ ∪ ran measures → dom 𝑀 ∈ V)
3	2	uniexd 7759	. . . . 5 ⊢ (𝑀 ∈ ∪ ran measures → ∪ dom 𝑀 ∈ V)
4	1, 3	eqeltrrid 2865	. . . 4 ⊢ (𝑀 ∈ ∪ ran measures → 𝑂 ∈ V)
5		rabexg 5298	. . . 4 ⊢ (𝑂 ∈ V → {𝑥 ∈ 𝑂 ∣ 𝜑} ∈ V)
6	4, 5	syl 18	. . 3 ⊢ (𝑀 ∈ ∪ ran measures → {𝑥 ∈ 𝑂 ∣ 𝜑} ∈ V)
7		simpr 490	. . . . . 6 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
8	7	dmeqd 5886	. . . . . . . 8 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
9	8	unieqd 4879	. . . . . . 7 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
10		simpl 488	. . . . . . 7 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → 𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑})
11	9, 10	difeq12d 4064	. . . . . 6 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → (∪ dom 𝑚 ∖ 𝑎) = (∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}))
12	7, 11	fveq12d 6892	. . . . 5 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → (𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})))
13	12	eqeq1d 2762	. . . 4 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → ((𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = 0 ↔ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0))
14		df-ae 34918	. . . 4 ⊢ a.e. = {⟨𝑎, 𝑚⟩ ∣ (𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = 0}
15	13, 14	brabga 5507	. . 3 ⊢ (({𝑥 ∈ 𝑂 ∣ 𝜑} ∈ V ∧ 𝑀 ∈ ∪ ran measures) → ({𝑥 ∈ 𝑂 ∣ 𝜑}a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0))
16	6, 15	mpancom 701	. 2 ⊢ (𝑀 ∈ ∪ ran measures → ({𝑥 ∈ 𝑂 ∣ 𝜑}a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0))
17	1	difeq1i 4059	. . . . 5 ⊢ (∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}) = (𝑂 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})
18		notrab 4267	. . . . 5 ⊢ (𝑂 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}) = {𝑥 ∈ 𝑂 ∣ ¬ 𝜑}
19	17, 18	eqtri 2783	. . . 4 ⊢ (∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}) = {𝑥 ∈ 𝑂 ∣ ¬ 𝜑}
20	19	fveq2i 6888	. . 3 ⊢ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = (𝑀‘{𝑥 ∈ 𝑂 ∣ ¬ 𝜑})
21	20	eqeq1i 2765	. 2 ⊢ ((𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0 ↔ (𝑀‘{𝑥 ∈ 𝑂 ∣ ¬ 𝜑}) = 0)
22	16, 21	bitrdi 290	1 ⊢ (𝑀 ∈ ∪ ran measures → ({𝑥 ∈ 𝑂 ∣ 𝜑}a.e.𝑀 ↔ (𝑀‘{𝑥 ∈ 𝑂 ∣ ¬ 𝜑}) = 0))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ∖ cdif 4045  ∪ cuni 4866   class class class wbr 5102  dom cdm 5650  ran crn 5651  ‘cfv 6538  0cc0 11203  measurescmeas 34874  a.e.cae 34916

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-cnv 5658  df-dm 5660  df-rn 5661  df-iota 6494  df-fv 6546  df-ae 34918

This theorem is used by:  truae  34922  aean  34923