Theorem braew 34761

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 7902	. . . . . 6 ⊢ (𝑀 ∈ ∪ ran measures → dom 𝑀 ∈ V)
3	2	uniexd 7748	. . . . 5 ⊢ (𝑀 ∈ ∪ ran measures → ∪ dom 𝑀 ∈ V)
4	1, 3	eqeltrrid 2867	. . . 4 ⊢ (𝑀 ∈ ∪ ran measures → 𝑂 ∈ V)
5		rabexg 5306	. . . 4 ⊢ (𝑂 ∈ V → {𝑥 ∈ 𝑂 ∣ 𝜑} ∈ V)
6	4, 5	syl 18	. . 3 ⊢ (𝑀 ∈ ∪ ran measures → {𝑥 ∈ 𝑂 ∣ 𝜑} ∈ V)
7		simpr 490	. . . . . 6 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
8	7	dmeqd 5893	. . . . . . . 8 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
9	8	unieqd 4883	. . . . . . 7 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
10		simpl 488	. . . . . . 7 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → 𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑})
11	9, 10	difeq12d 4078	. . . . . 6 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → (∪ dom 𝑚 ∖ 𝑎) = (∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}))
12	7, 11	fveq12d 6889	. . . . 5 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → (𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})))
13	12	eqeq1d 2764	. . . 4 ⊢ ((𝑎 = {𝑥 ∈ 𝑂 ∣ 𝜑} ∧ 𝑚 = 𝑀) → ((𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = 0 ↔ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0))
14		df-ae 34758	. . . 4 ⊢ a.e. = {⟨𝑎, 𝑚⟩ ∣ (𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = 0}
15	13, 14	brabga 5516	. . 3 ⊢ (({𝑥 ∈ 𝑂 ∣ 𝜑} ∈ V ∧ 𝑀 ∈ ∪ ran measures) → ({𝑥 ∈ 𝑂 ∣ 𝜑}a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0))
16	6, 15	mpancom 701	. 2 ⊢ (𝑀 ∈ ∪ ran measures → ({𝑥 ∈ 𝑂 ∣ 𝜑}a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = 0))
17	1	difeq1i 4073	. . . . 5 ⊢ (∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}) = (𝑂 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})
18		notrab 4271	. . . . 5 ⊢ (𝑂 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}) = {𝑥 ∈ 𝑂 ∣ ¬ 𝜑}
19	17, 18	eqtri 2785	. . . 4 ⊢ (∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑}) = {𝑥 ∈ 𝑂 ∣ ¬ 𝜑}
20	19	fveq2i 6885	. . 3 ⊢ (𝑀‘(∪ dom 𝑀 ∖ {𝑥 ∈ 𝑂 ∣ 𝜑})) = (𝑀‘{𝑥 ∈ 𝑂 ∣ ¬ 𝜑})
21	20	eqeq1i 2767	. 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 1570   ∈ wcel 2145  {crab 3414  Vcvv 3453   ∖ cdif 3899  ∪ cuni 4870   class class class wbr 5107  dom cdm 5659  ran crn 5660  ‘cfv 6537  0cc0 11128  measurescmeas 34714  a.e.cae 34756

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402  ax-un 7740

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-cnv 5667  df-dm 5669  df-rn 5670  df-iota 6493  df-fv 6545  df-ae 34758

This theorem is used by:  truae  34762  aean  34763