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

Theorem 1stmbfm 34620
Description: The first projection map is measurable with regard to the product sigma-algebra. (Contributed by Thierry Arnoux, 3-Jun-2017.)
Hypotheses
Ref Expression
1stmbfm.1 (𝜑𝑆 ran sigAlgebra)
1stmbfm.2 (𝜑𝑇 ran sigAlgebra)
Assertion
Ref Expression
1stmbfm (𝜑 → (1st ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑆))

Proof of Theorem 1stmbfm
Dummy variables 𝑧 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1stres 8013 . . . 4 (1st ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑆
2 1stmbfm.1 . . . . . 6 (𝜑𝑆 ran sigAlgebra)
3 1stmbfm.2 . . . . . 6 (𝜑𝑇 ran sigAlgebra)
4 sxuni 34553 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
52, 3, 4syl2anc 595 . . . . 5 (𝜑 → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
65feq2d 6693 . . . 4 (𝜑 → ((1st ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑆 ↔ (1st ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑆))
71, 6mpbii 236 . . 3 (𝜑 → (1st ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑆)
8 unielsiga 34488 . . . . 5 (𝑆 ran sigAlgebra → 𝑆𝑆)
92, 8syl 18 . . . 4 (𝜑 𝑆𝑆)
10 sxsiga 34551 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
112, 3, 10syl2anc 595 . . . . 5 (𝜑 → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
12 unielsiga 34488 . . . . 5 ((𝑆 ×s 𝑇) ∈ ran sigAlgebra → (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
1311, 12syl 18 . . . 4 (𝜑 (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
149, 13elmapd 8840 . . 3 (𝜑 → ((1st ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑆m (𝑆 ×s 𝑇)) ↔ (1st ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑆))
157, 14mpbird 260 . 2 (𝜑 → (1st ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑆m (𝑆 ×s 𝑇)))
16 ffn 6709 . . . . . . . 8 ((1st ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑆 → (1st ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇))
17 elpreima 7057 . . . . . . . 8 ((1st ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇) → (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎)))
181, 16, 17mp2b 10 . . . . . . 7 (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎))
19 fvres 6904 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) = (1st𝑧))
2019eleq1d 2855 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎 ↔ (1st𝑧) ∈ 𝑎))
21 1st2nd2 8028 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
22 xp2nd 8022 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → (2nd𝑧) ∈ 𝑇)
23 elxp6 8023 . . . . . . . . . . . 12 (𝑧 ∈ (𝑎 × 𝑇) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑎 ∧ (2nd𝑧) ∈ 𝑇)))
24 anass 473 . . . . . . . . . . . 12 (((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑎) ∧ (2nd𝑧) ∈ 𝑇) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑎 ∧ (2nd𝑧) ∈ 𝑇)))
25 an32 658 . . . . . . . . . . . 12 (((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑎) ∧ (2nd𝑧) ∈ 𝑇) ↔ ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (2nd𝑧) ∈ 𝑇) ∧ (1st𝑧) ∈ 𝑎))
2623, 24, 253bitr2i 302 . . . . . . . . . . 11 (𝑧 ∈ (𝑎 × 𝑇) ↔ ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (2nd𝑧) ∈ 𝑇) ∧ (1st𝑧) ∈ 𝑎))
2726baib 544 . . . . . . . . . 10 ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (2nd𝑧) ∈ 𝑇) → (𝑧 ∈ (𝑎 × 𝑇) ↔ (1st𝑧) ∈ 𝑎))
2821, 22, 27syl2anc 595 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (𝑧 ∈ (𝑎 × 𝑇) ↔ (1st𝑧) ∈ 𝑎))
2920, 28bitr4d 285 . . . . . . . 8 (𝑧 ∈ ( 𝑆 × 𝑇) → (((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎𝑧 ∈ (𝑎 × 𝑇)))
3029pm5.32i 584 . . . . . . 7 ((𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ (𝑎 × 𝑇)))
3118, 30bitri 278 . . . . . 6 (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ (𝑎 × 𝑇)))
32 sgon 34484 . . . . . . . . . . 11 (𝑆 ran sigAlgebra → 𝑆 ∈ (sigAlgebra‘ 𝑆))
33 sigasspw 34476 . . . . . . . . . . 11 (𝑆 ∈ (sigAlgebra‘ 𝑆) → 𝑆 ⊆ 𝒫 𝑆)
34 pwssb 5072 . . . . . . . . . . . 12 (𝑆 ⊆ 𝒫 𝑆 ↔ ∀𝑎𝑆 𝑎 𝑆)
3534biimpi 219 . . . . . . . . . . 11 (𝑆 ⊆ 𝒫 𝑆 → ∀𝑎𝑆 𝑎 𝑆)
362, 32, 33, 354syl 20 . . . . . . . . . 10 (𝜑 → ∀𝑎𝑆 𝑎 𝑆)
3736r19.21bi 3264 . . . . . . . . 9 ((𝜑𝑎𝑆) → 𝑎 𝑆)
38 xpss1 5684 . . . . . . . . 9 (𝑎 𝑆 → (𝑎 × 𝑇) ⊆ ( 𝑆 × 𝑇))
3937, 38syl 18 . . . . . . . 8 ((𝜑𝑎𝑆) → (𝑎 × 𝑇) ⊆ ( 𝑆 × 𝑇))
4039sseld 3944 . . . . . . 7 ((𝜑𝑎𝑆) → (𝑧 ∈ (𝑎 × 𝑇) → 𝑧 ∈ ( 𝑆 × 𝑇)))
4140pm4.71rd 571 . . . . . 6 ((𝜑𝑎𝑆) → (𝑧 ∈ (𝑎 × 𝑇) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ (𝑎 × 𝑇))))
4231, 41bitr4id 293 . . . . 5 ((𝜑𝑎𝑆) → (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ 𝑧 ∈ (𝑎 × 𝑇)))
4342eqrdv 2768 . . . 4 ((𝜑𝑎𝑆) → ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) = (𝑎 × 𝑇))
442adantr 485 . . . . 5 ((𝜑𝑎𝑆) → 𝑆 ran sigAlgebra)
453adantr 485 . . . . 5 ((𝜑𝑎𝑆) → 𝑇 ran sigAlgebra)
46 simpr 489 . . . . 5 ((𝜑𝑎𝑆) → 𝑎𝑆)
47 eqid 2770 . . . . . . . 8 𝑇 = 𝑇
48 issgon 34483 . . . . . . . 8 (𝑇 ∈ (sigAlgebra‘ 𝑇) ↔ (𝑇 ran sigAlgebra ∧ 𝑇 = 𝑇))
493, 47, 48sylanblrc 601 . . . . . . 7 (𝜑𝑇 ∈ (sigAlgebra‘ 𝑇))
50 baselsiga 34475 . . . . . . 7 (𝑇 ∈ (sigAlgebra‘ 𝑇) → 𝑇𝑇)
5149, 50syl 18 . . . . . 6 (𝜑 𝑇𝑇)
5251adantr 485 . . . . 5 ((𝜑𝑎𝑆) → 𝑇𝑇)
53 elsx 34554 . . . . 5 (((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) ∧ (𝑎𝑆 𝑇𝑇)) → (𝑎 × 𝑇) ∈ (𝑆 ×s 𝑇))
5444, 45, 46, 52, 53syl22anc 851 . . . 4 ((𝜑𝑎𝑆) → (𝑎 × 𝑇) ∈ (𝑆 ×s 𝑇))
5543, 54eqeltrd 2870 . . 3 ((𝜑𝑎𝑆) → ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5655ralrimiva 3164 . 2 (𝜑 → ∀𝑎𝑆 ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5711, 2ismbfm 34611 . 2 (𝜑 → ((1st ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑆) ↔ ((1st ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑆m (𝑆 ×s 𝑇)) ∧ ∀𝑎𝑆 ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))))
5815, 56, 57mpbir2and 725 1 (𝜑 → (1st ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wcel 2150  wral 3086  wss 3913  𝒫 cpw 4567  cop 4600   cuni 4877   × cxp 5663  ccnv 5664  ran crn 5666  cres 5667  cima 5668   Fn wfn 6535  wf 6536  cfv 6540  (class class class)co 7414  1st c1st 7987  2nd c2nd 7988  m cmap 8827  sigAlgebracsiga 34468   ×s csx 34548  MblFnMcmbfm 34609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5340  ax-pr 5408  ax-un 7736
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2099  df-mo 2574  df-eu 2604  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ne 2966  df-ral 3087  df-rex 3097  df-reu 3377  df-rab 3424  df-v 3464  df-sbc 3753  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5560  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7989  df-2nd 7990  df-map 8829  df-siga 34469  df-sigagen 34499  df-sx 34549  df-mbfm 34610
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator