Theorem faeval 34668

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 5900	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑟 = dom 𝑅)
3		simpr 490	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
4	3	dmeqd 5900	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
5	4	unieqd 4890	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
6	2, 5	oveq12d 7441	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (dom 𝑟 ↑m ∪ dom 𝑚) = (dom 𝑅 ↑m ∪ dom 𝑀))
7	6	eleq2d 2852	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ↔ 𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
8	6	eleq2d 2852	. . . . 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 5125	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ((𝑓‘𝑥)𝑟(𝑔‘𝑥) ↔ (𝑓‘𝑥)𝑅(𝑔‘𝑥)))
11	5, 10	rabeqbidv 3437	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)} = {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)})
12	11, 3	breq12d 5127	. . . 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 5182	. 2 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})
15		df-fae 34667	. 2 ⊢ ~ a.e. = (𝑟 ∈ V, 𝑚 ∈ ∪ ran measures ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)})
16		ovex 7456	. . . 4 ⊢ (dom 𝑅 ↑m ∪ dom 𝑀) ∈ V
17	16, 16	xpex 7761	. . 3 ⊢ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀)) ∈ V
18		opabssxp 5758	. . 3 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ⊆ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀))
19	17, 18	ssexi 5298	. 2 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ∈ V
20	14, 15, 19	ovmpoa 7578	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 2146  {crab 3419  Vcvv 3458  ∪ cuni 4877   class class class wbr 5114  {copab 5178   × cxp 5664  dom cdm 5666  ran crn 5667  ‘cfv 6543  (class class class)co 7423   ↑_m cmap 8833  measurescmeas 34617  a.e.cae 34659  ~ a.e.cfae 34660

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-fae 34667

This theorem is used by:  relfae  34669  brfae  34670