Theorem faeval 34962

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 5895	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑟 = dom 𝑅)
3		simpr 490	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
4	3	dmeqd 5895	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
5	4	unieqd 4883	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
6	2, 5	oveq12d 7464	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (dom 𝑟 ↑m ∪ dom 𝑚) = (dom 𝑅 ↑m ∪ dom 𝑀))
7	6	eleq2d 2850	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ↔ 𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
8	6	eleq2d 2850	. . . . 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 5117	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ((𝑓‘𝑥)𝑟(𝑔‘𝑥) ↔ (𝑓‘𝑥)𝑅(𝑔‘𝑥)))
11	5, 10	rabeqbidv 3433	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)} = {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)})
12	11, 3	breq12d 5119	. . . 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 5175	. 2 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})
15		df-fae 34961	. 2 ⊢ ~a.e. = (𝑟 ∈ V, 𝑚 ∈ ∪ ran measures ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)})
16		ovex 7479	. . . 4 ⊢ (dom 𝑅 ↑m ∪ dom 𝑀) ∈ V
17	16, 16	xpex 7794	. . 3 ⊢ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀)) ∈ V
18		opabssxp 5749	. . 3 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ⊆ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀))
19	17, 18	ssexi 5289	. 2 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ∈ V
20	14, 15, 19	ovmpoa 7602	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 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  ∪ cuni 4870   class class class wbr 5106  {copab 5171   × cxp 5654  dom cdm 5656  ran crn 5657  ‘cfv 6561  (class class class)co 7446   ↑_m cmap 8878  measurescmeas 34911  a.e.cae 34953  ~_a.e.cfae 34954

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-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

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-rab 3417  df-v 3456  df-sbc 3743  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-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-fae 34961

This theorem is used by:  relfae  34963  brfae  34964