Theorem brae 34631

Description: 'almost everywhere' relation for a measure and a measurable set 𝐴. (Contributed by Thierry Arnoux, 20-Oct-2017.)

Assertion

Ref	Expression
brae	⊢ ((𝑀 ∈ ∪ ran measures ∧ 𝐴 ∈ dom 𝑀) → (𝐴a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ 𝐴)) = 0))

Proof of Theorem brae

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

Step	Hyp	Ref	Expression
1		simpr 489	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
2	1	dmeqd 5895	. . . . . . 7 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
3	2	unieqd 4885	. . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
4		simpl 487	. . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → 𝑎 = 𝐴)
5	3, 4	difeq12d 4082	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → (∪ dom 𝑚 ∖ 𝑎) = (∪ dom 𝑀 ∖ 𝐴))
6	1, 5	fveq12d 6888	. . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → (𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = (𝑀‘(∪ dom 𝑀 ∖ 𝐴)))
7	6	eqeq1d 2765	. . 3 ⊢ ((𝑎 = 𝐴 ∧ 𝑚 = 𝑀) → ((𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = 0 ↔ (𝑀‘(∪ dom 𝑀 ∖ 𝐴)) = 0))
8		df-ae 34629	. . 3 ⊢ a.e. = {⟨𝑎, 𝑚⟩ ∣ (𝑚‘(∪ dom 𝑚 ∖ 𝑎)) = 0}
9	7, 8	brabga 5518	. 2 ⊢ ((𝐴 ∈ dom 𝑀 ∧ 𝑀 ∈ ∪ ran measures) → (𝐴a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ 𝐴)) = 0))
10	9	ancoms 463	1 ⊢ ((𝑀 ∈ ∪ ran measures ∧ 𝐴 ∈ dom 𝑀) → (𝐴a.e.𝑀 ↔ (𝑀‘(∪ dom 𝑀 ∖ 𝐴)) = 0))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ∖ cdif 3902  ∪ cuni 4872   class class class wbr 5109  dom cdm 5661  ran crn 5662  ‘cfv 6536  0cc0 11095  measurescmeas 34585  a.e.cae 34627

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-dm 5671  df-iota 6492  df-fv 6544  df-ae 34629

This theorem is referenced by: (None)