Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brfae Structured version   Visualization version   GIF version

Theorem brfae 34992
Description: 'almost everywhere' relation for two functions 𝐹 and 𝐺 with regard to the measure 𝑀. (Contributed by Thierry Arnoux, 22-Oct-2017.)
Hypotheses
Ref Expression
brfae.0 dom 𝑅 = 𝐷
brfae.1 (𝜑 → 𝑅 ∈ V)
brfae.2 (𝜑 → 𝑀 ∈ ∪ ran measures)
brfae.3 (𝜑 → 𝐹 ∈ (𝐷 ↑m ∪ dom 𝑀))
brfae.4 (𝜑 → 𝐺 ∈ (𝐷 ↑m ∪ dom 𝑀))
Assertion
Ref Expression
brfae (𝜑 → (𝐹(𝑅~a.e.𝑀)𝐺 ↔ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝑀   𝑥,𝑅
Allowed substitution hints:   𝜑(𝑥)   𝐷(𝑥)

Proof of Theorem brfae
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brfae.3 . . 3 (𝜑 → 𝐹 ∈ (𝐷 ↑m ∪ dom 𝑀))
2 brfae.4 . . 3 (𝜑 → 𝐺 ∈ (𝐷 ↑m ∪ dom 𝑀))
3 simpl 488 . . . . . . 7 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
43eleq1d 2849 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ↔ 𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
5 simpr 490 . . . . . . 7 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
65eleq1d 2849 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ↔ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
74, 6anbi12d 644 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ↔ (𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀))))
83fveq1d 6918 . . . . . . . 8 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑓‘𝑥) = (𝐹‘𝑥))
95fveq1d 6918 . . . . . . . 8 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑔‘𝑥) = (𝐺‘𝑥))
108, 9breq12d 5121 . . . . . . 7 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)𝑅(𝑔‘𝑥) ↔ (𝐹‘𝑥)𝑅(𝐺‘𝑥)))
1110rabbidv 3423 . . . . . 6 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)} = {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)})
1211breq1d 5118 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ({𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀 ↔ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀))
137, 12anbi12d 644 . . . 4 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀) ↔ ((𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀)))
14 eqid 2763 . . . 4 {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)}
1513, 14brabga 5515 . . 3 ((𝐹 ∈ (𝐷 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (𝐷 ↑m ∪ dom 𝑀)) → (𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)}𝐺 ↔ ((𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀)))
161, 2, 15syl2anc 596 . 2 (𝜑 → (𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)}𝐺 ↔ ((𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀)))
17 brfae.1 . . . 4 (𝜑 → 𝑅 ∈ V)
18 brfae.2 . . . 4 (𝜑 → 𝑀 ∈ ∪ ran measures)
19 faeval 34990 . . . 4 ((𝑅 ∈ V ∧ 𝑀 ∈ ∪ ran measures) → (𝑅~a.e.𝑀) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})
2017, 18, 19syl2anc 596 . . 3 (𝜑 → (𝑅~a.e.𝑀) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)})
2120breqd 5119 . 2 (𝜑 → (𝐹(𝑅~a.e.𝑀)𝐺 ↔ 𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝑔 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝑓‘𝑥)𝑅(𝑔‘𝑥)}a.e.𝑀)}𝐺))
22 brfae.0 . . . . . 6 dom 𝑅 = 𝐷
2322oveq1i 7461 . . . . 5 (dom 𝑅 ↑m ∪ dom 𝑀) = (𝐷 ↑m ∪ dom 𝑀)
241, 23eleqtrrdi 2875 . . . 4 (𝜑 → 𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀))
252, 23eleqtrrdi 2875 . . . 4 (𝜑 → 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀))
2624, 25jca 521 . . 3 (𝜑 → (𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)))
2726biantrurd 542 . 2 (𝜑 → ({𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀 ↔ ((𝐹 ∈ (dom 𝑅 ↑m ∪ dom 𝑀) ∧ 𝐺 ∈ (dom 𝑅 ↑m ∪ dom 𝑀)) ∧ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀)))
2816, 21, 273bitr4d 314 1 (𝜑 → (𝐹(𝑅~a.e.𝑀)𝐺 ↔ {𝑥 ∈ ∪ dom 𝑀 ∣ (𝐹‘𝑥)𝑅(𝐺‘𝑥)}a.e.𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  ∪ cuni 4872   class class class wbr 5108  {copab 5173  dom cdm 5658  ran crn 5659  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885  measurescmeas 34939  a.e.cae 34981  ~a.e.cfae 34982
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 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-fae 34989
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator