Theorem faeval 34925

Description: Value of the 'almost everywhere' relation for a given relation and measure. (Contributed by Thierry Arnoux, 22-Oct-2017.)

Assertion

Ref	Expression
faeval	⊢ ((𝑅 ∈ V ∧ 𝑀 ∈ ∪ ran measures) → (𝑅~a.e.𝑀) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})

Distinct variable groups:   𝑓,𝑔,𝑥,𝑀   𝑅,𝑓,𝑔,𝑥

Proof of Theorem faeval

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

Step	Hyp	Ref	Expression
1		simpl 488	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → 𝑟 = 𝑅)
2	1	dmeqd 5886	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑟 = dom 𝑅)
3		simpr 490	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
4	3	dmeqd 5886	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
5	4	unieqd 4879	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
6	2, 5	oveq12d 7438	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (dom 𝑟 ↑m ∪ dom 𝑚) = (dom 𝑅 ↑m ∪ dom 𝑀))
7	6	eleq2d 2846	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ↔ 𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
8	6	eleq2d 2846	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ↔ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
9	7, 8	anbi12d 644	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ↔ (𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀))))
10	1	breqd 5113	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ((𝑓‘𝑥)𝑟(𝑔‘𝑥) ↔ (𝑓‘𝑥)𝑅(𝑔‘𝑥)))
11	5, 10	rabeqbidv 3429	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)} = {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)})
12	11, 3	breq12d 5115	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ({𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚 ↔ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀))
13	9, 12	anbi12d 644	. . 3 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚) ↔ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)))
14	13	opabbidv 5170	. 2 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})
15		df-fae 34924	. 2 ⊢ ~a.e. = (𝑟 ∈ V, 𝑚 ∈ ∪ ran measures ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)})
16		ovex 7453	. . . 4 ⊢ (dom 𝑅 ↑m ∪ dom 𝑀) ∈ V
17	16, 16	xpex 7767	. . 3 ⊢ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀)) ∈ V
18		opabssxp 5742	. . 3 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ⊆ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀))
19	17, 18	ssexi 5283	. 2 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ∈ V
20	14, 15, 19	ovmpoa 7575	1 ⊢ ((𝑅 ∈ V ∧ 𝑀 ∈ ∪ ran measures) → (𝑅~a.e.𝑀) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450  ∪ cuni 4866   class class class wbr 5102  {copab 5166   × cxp 5648  dom cdm 5650  ran crn 5651  ‘cfv 6538  (class class class)co 7420   ↑_m cmap 8850  measurescmeas 34874  a.e.cae 34916  ~_a.e.cfae 34917

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-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  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-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  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-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-fae 34924

This theorem is used by:  relfae  34926  brfae  34927