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

Theorem 2ndmbfm 34293
Description: The second 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
2ndmbfm (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑇))

Proof of Theorem 2ndmbfm
Dummy variables 𝑧 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f2ndres 8013 . . . 4 (2nd ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑇
2 1stmbfm.1 . . . . . 6 (𝜑𝑆 ran sigAlgebra)
3 1stmbfm.2 . . . . . 6 (𝜑𝑇 ran sigAlgebra)
4 sxuni 34224 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
52, 3, 4syl2anc 584 . . . . 5 (𝜑 → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
65feq2d 6692 . . . 4 (𝜑 → ((2nd ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑇 ↔ (2nd ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑇))
71, 6mpbii 233 . . 3 (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑇)
8 unielsiga 34159 . . . . 5 (𝑇 ran sigAlgebra → 𝑇𝑇)
93, 8syl 17 . . . 4 (𝜑 𝑇𝑇)
10 sxsiga 34222 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
112, 3, 10syl2anc 584 . . . . 5 (𝜑 → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
12 unielsiga 34159 . . . . 5 ((𝑆 ×s 𝑇) ∈ ran sigAlgebra → (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
1311, 12syl 17 . . . 4 (𝜑 (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
149, 13elmapd 8854 . . 3 (𝜑 → ((2nd ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑇m (𝑆 ×s 𝑇)) ↔ (2nd ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑇))
157, 14mpbird 257 . 2 (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑇m (𝑆 ×s 𝑇)))
16 ffn 6706 . . . . . . . 8 ((2nd ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑇 → (2nd ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇))
17 elpreima 7048 . . . . . . . 8 ((2nd ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇) → (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎)))
181, 16, 17mp2b 10 . . . . . . 7 (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎))
19 fvres 6895 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) = (2nd𝑧))
2019eleq1d 2819 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎 ↔ (2nd𝑧) ∈ 𝑎))
21 1st2nd2 8027 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
22 xp1st 8020 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → (1st𝑧) ∈ 𝑆)
23 elxp6 8022 . . . . . . . . . . . 12 (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑎)))
24 anass 468 . . . . . . . . . . . 12 (((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑆) ∧ (2nd𝑧) ∈ 𝑎) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑎)))
2523, 24bitr4i 278 . . . . . . . . . . 11 (𝑧 ∈ ( 𝑆 × 𝑎) ↔ ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑆) ∧ (2nd𝑧) ∈ 𝑎))
2625baib 535 . . . . . . . . . 10 ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑆) → (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (2nd𝑧) ∈ 𝑎))
2721, 22, 26syl2anc 584 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (2nd𝑧) ∈ 𝑎))
2820, 27bitr4d 282 . . . . . . . 8 (𝑧 ∈ ( 𝑆 × 𝑇) → (((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎𝑧 ∈ ( 𝑆 × 𝑎)))
2928pm5.32i 574 . . . . . . 7 ((𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ ( 𝑆 × 𝑎)))
3018, 29bitri 275 . . . . . 6 (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ ( 𝑆 × 𝑎)))
31 sgon 34155 . . . . . . . . . . 11 (𝑇 ran sigAlgebra → 𝑇 ∈ (sigAlgebra‘ 𝑇))
32 sigasspw 34147 . . . . . . . . . . 11 (𝑇 ∈ (sigAlgebra‘ 𝑇) → 𝑇 ⊆ 𝒫 𝑇)
33 pwssb 5077 . . . . . . . . . . . 12 (𝑇 ⊆ 𝒫 𝑇 ↔ ∀𝑎𝑇 𝑎 𝑇)
3433biimpi 216 . . . . . . . . . . 11 (𝑇 ⊆ 𝒫 𝑇 → ∀𝑎𝑇 𝑎 𝑇)
353, 31, 32, 344syl 19 . . . . . . . . . 10 (𝜑 → ∀𝑎𝑇 𝑎 𝑇)
3635r19.21bi 3234 . . . . . . . . 9 ((𝜑𝑎𝑇) → 𝑎 𝑇)
37 xpss2 5674 . . . . . . . . 9 (𝑎 𝑇 → ( 𝑆 × 𝑎) ⊆ ( 𝑆 × 𝑇))
3836, 37syl 17 . . . . . . . 8 ((𝜑𝑎𝑇) → ( 𝑆 × 𝑎) ⊆ ( 𝑆 × 𝑇))
3938sseld 3957 . . . . . . 7 ((𝜑𝑎𝑇) → (𝑧 ∈ ( 𝑆 × 𝑎) → 𝑧 ∈ ( 𝑆 × 𝑇)))
4039pm4.71rd 562 . . . . . 6 ((𝜑𝑎𝑇) → (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ ( 𝑆 × 𝑎))))
4130, 40bitr4id 290 . . . . 5 ((𝜑𝑎𝑇) → (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ 𝑧 ∈ ( 𝑆 × 𝑎)))
4241eqrdv 2733 . . . 4 ((𝜑𝑎𝑇) → ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) = ( 𝑆 × 𝑎))
432adantr 480 . . . . 5 ((𝜑𝑎𝑇) → 𝑆 ran sigAlgebra)
443adantr 480 . . . . 5 ((𝜑𝑎𝑇) → 𝑇 ran sigAlgebra)
45 eqid 2735 . . . . . . . 8 𝑆 = 𝑆
46 issgon 34154 . . . . . . . 8 (𝑆 ∈ (sigAlgebra‘ 𝑆) ↔ (𝑆 ran sigAlgebra ∧ 𝑆 = 𝑆))
472, 45, 46sylanblrc 590 . . . . . . 7 (𝜑𝑆 ∈ (sigAlgebra‘ 𝑆))
48 baselsiga 34146 . . . . . . 7 (𝑆 ∈ (sigAlgebra‘ 𝑆) → 𝑆𝑆)
4947, 48syl 17 . . . . . 6 (𝜑 𝑆𝑆)
5049adantr 480 . . . . 5 ((𝜑𝑎𝑇) → 𝑆𝑆)
51 simpr 484 . . . . 5 ((𝜑𝑎𝑇) → 𝑎𝑇)
52 elsx 34225 . . . . 5 (((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) ∧ ( 𝑆𝑆𝑎𝑇)) → ( 𝑆 × 𝑎) ∈ (𝑆 ×s 𝑇))
5343, 44, 50, 51, 52syl22anc 838 . . . 4 ((𝜑𝑎𝑇) → ( 𝑆 × 𝑎) ∈ (𝑆 ×s 𝑇))
5442, 53eqeltrd 2834 . . 3 ((𝜑𝑎𝑇) → ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5554ralrimiva 3132 . 2 (𝜑 → ∀𝑎𝑇 ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5611, 3ismbfm 34282 . 2 (𝜑 → ((2nd ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑇) ↔ ((2nd ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑇m (𝑆 ×s 𝑇)) ∧ ∀𝑎𝑇 ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))))
5715, 55, 56mpbir2and 713 1 (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑇))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wral 3051  wss 3926  𝒫 cpw 4575  cop 4607   cuni 4883   × cxp 5652  ccnv 5653  ran crn 5655  cres 5656  cima 5657   Fn wfn 6526  wf 6527  cfv 6531  (class class class)co 7405  1st c1st 7986  2nd c2nd 7987  m cmap 8840  sigAlgebracsiga 34139   ×s csx 34219  MblFnMcmbfm 34280
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-map 8842  df-siga 34140  df-sigagen 34170  df-sx 34220  df-mbfm 34281
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator