Theorem faeval 34765

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 5893	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑟 = dom 𝑅)
3		simpr 490	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
4	3	dmeqd 5893	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → dom 𝑚 = dom 𝑀)
5	4	unieqd 4883	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ∪ dom 𝑚 = ∪ dom 𝑀)
6	2, 5	oveq12d 7435	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (dom 𝑟 ↑m ∪ dom 𝑚) = (dom 𝑅 ↑m ∪ dom 𝑀))
7	6	eleq2d 2848	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ↔ 𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
8	6	eleq2d 2848	. . . . 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 5118	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → ((𝑓‘𝑥)𝑟(𝑔‘𝑥) ↔ (𝑓‘𝑥)𝑅(𝑔‘𝑥)))
11	5, 10	rabeqbidv 3432	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)} = {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)})
12	11, 3	breq12d 5120	. . . 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 34764	. 2 ⊢ ~ a.e. = (𝑟 ∈ V, 𝑚 ∈ ∪ ran measures ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑟 ↑m ∪ dom 𝑚) ∧ 𝑔 ∈ (dom 𝑟 ↑m ∪ dom 𝑚)) ∧ {𝑥 ∈ ∪ dom 𝑚 ∣ (𝑓‘𝑥)𝑟(𝑔‘𝑥)}a.e.𝑚)})
16		ovex 7450	. . . 4 ⊢ (dom 𝑅 ↑m ∪ dom 𝑀) ∈ V
17	16, 16	xpex 7756	. . 3 ⊢ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀)) ∈ V
18		opabssxp 5751	. . 3 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ⊆ ((dom 𝑅 ↑m ∪ dom 𝑀) × (dom 𝑅 ↑m ∪ dom 𝑀))
19	17, 18	ssexi 5291	. 2 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} ∈ V
20	14, 15, 19	ovmpoa 7572	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 2145  {crab 3414  Vcvv 3453  ∪ cuni 4870   class class class wbr 5107  {copab 5171   × cxp 5657  dom cdm 5659  ran crn 5660  ‘cfv 6537  (class class class)co 7417   ↑_m cmap 8830  measurescmeas 34714  a.e.cae 34756  ~ a.e.cfae 34757

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-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  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-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  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-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-fae 34764

This theorem is used by:  relfae  34766  brfae  34767