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 34444
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 7969 . . . 4 (1st ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑆
2 1stmbfm.1 . . . . . 6 (𝜑𝑆 ran sigAlgebra)
3 1stmbfm.2 . . . . . 6 (𝜑𝑇 ran sigAlgebra)
4 sxuni 34377 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
52, 3, 4syl2anc 585 . . . . 5 (𝜑 → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
65feq2d 6656 . . . 4 (𝜑 → ((1st ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑆 ↔ (1st ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑆))
71, 6mpbii 233 . . 3 (𝜑 → (1st ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑆)
8 unielsiga 34312 . . . . 5 (𝑆 ran sigAlgebra → 𝑆𝑆)
92, 8syl 17 . . . 4 (𝜑 𝑆𝑆)
10 sxsiga 34375 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
112, 3, 10syl2anc 585 . . . . 5 (𝜑 → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
12 unielsiga 34312 . . . . 5 ((𝑆 ×s 𝑇) ∈ ran sigAlgebra → (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
1311, 12syl 17 . . . 4 (𝜑 (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
149, 13elmapd 8791 . . 3 (𝜑 → ((1st ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑆m (𝑆 ×s 𝑇)) ↔ (1st ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑆))
157, 14mpbird 257 . 2 (𝜑 → (1st ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑆m (𝑆 ×s 𝑇)))
16 ffn 6672 . . . . . . . 8 ((1st ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑆 → (1st ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇))
17 elpreima 7014 . . . . . . . 8 ((1st ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇) → (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎)))
181, 16, 17mp2b 10 . . . . . . 7 (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎))
19 fvres 6863 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) = (1st𝑧))
2019eleq1d 2822 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎 ↔ (1st𝑧) ∈ 𝑎))
21 1st2nd2 7984 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
22 xp2nd 7978 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → (2nd𝑧) ∈ 𝑇)
23 elxp6 7979 . . . . . . . . . . . 12 (𝑧 ∈ (𝑎 × 𝑇) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑎 ∧ (2nd𝑧) ∈ 𝑇)))
24 anass 468 . . . . . . . . . . . 12 (((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑎) ∧ (2nd𝑧) ∈ 𝑇) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑎 ∧ (2nd𝑧) ∈ 𝑇)))
25 an32 647 . . . . . . . . . . . 12 (((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑎) ∧ (2nd𝑧) ∈ 𝑇) ↔ ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (2nd𝑧) ∈ 𝑇) ∧ (1st𝑧) ∈ 𝑎))
2623, 24, 253bitr2i 299 . . . . . . . . . . 11 (𝑧 ∈ (𝑎 × 𝑇) ↔ ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (2nd𝑧) ∈ 𝑇) ∧ (1st𝑧) ∈ 𝑎))
2726baib 535 . . . . . . . . . 10 ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (2nd𝑧) ∈ 𝑇) → (𝑧 ∈ (𝑎 × 𝑇) ↔ (1st𝑧) ∈ 𝑎))
2821, 22, 27syl2anc 585 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (𝑧 ∈ (𝑎 × 𝑇) ↔ (1st𝑧) ∈ 𝑎))
2920, 28bitr4d 282 . . . . . . . 8 (𝑧 ∈ ( 𝑆 × 𝑇) → (((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎𝑧 ∈ (𝑎 × 𝑇)))
3029pm5.32i 574 . . . . . . 7 ((𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((1st ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ (𝑎 × 𝑇)))
3118, 30bitri 275 . . . . . 6 (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ (𝑎 × 𝑇)))
32 sgon 34308 . . . . . . . . . . 11 (𝑆 ran sigAlgebra → 𝑆 ∈ (sigAlgebra‘ 𝑆))
33 sigasspw 34300 . . . . . . . . . . 11 (𝑆 ∈ (sigAlgebra‘ 𝑆) → 𝑆 ⊆ 𝒫 𝑆)
34 pwssb 5058 . . . . . . . . . . . 12 (𝑆 ⊆ 𝒫 𝑆 ↔ ∀𝑎𝑆 𝑎 𝑆)
3534biimpi 216 . . . . . . . . . . 11 (𝑆 ⊆ 𝒫 𝑆 → ∀𝑎𝑆 𝑎 𝑆)
362, 32, 33, 354syl 19 . . . . . . . . . 10 (𝜑 → ∀𝑎𝑆 𝑎 𝑆)
3736r19.21bi 3230 . . . . . . . . 9 ((𝜑𝑎𝑆) → 𝑎 𝑆)
38 xpss1 5653 . . . . . . . . 9 (𝑎 𝑆 → (𝑎 × 𝑇) ⊆ ( 𝑆 × 𝑇))
3937, 38syl 17 . . . . . . . 8 ((𝜑𝑎𝑆) → (𝑎 × 𝑇) ⊆ ( 𝑆 × 𝑇))
4039sseld 3934 . . . . . . 7 ((𝜑𝑎𝑆) → (𝑧 ∈ (𝑎 × 𝑇) → 𝑧 ∈ ( 𝑆 × 𝑇)))
4140pm4.71rd 562 . . . . . 6 ((𝜑𝑎𝑆) → (𝑧 ∈ (𝑎 × 𝑇) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ (𝑎 × 𝑇))))
4231, 41bitr4id 290 . . . . 5 ((𝜑𝑎𝑆) → (𝑧 ∈ ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ 𝑧 ∈ (𝑎 × 𝑇)))
4342eqrdv 2735 . . . 4 ((𝜑𝑎𝑆) → ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) = (𝑎 × 𝑇))
442adantr 480 . . . . 5 ((𝜑𝑎𝑆) → 𝑆 ran sigAlgebra)
453adantr 480 . . . . 5 ((𝜑𝑎𝑆) → 𝑇 ran sigAlgebra)
46 simpr 484 . . . . 5 ((𝜑𝑎𝑆) → 𝑎𝑆)
47 eqid 2737 . . . . . . . 8 𝑇 = 𝑇
48 issgon 34307 . . . . . . . 8 (𝑇 ∈ (sigAlgebra‘ 𝑇) ↔ (𝑇 ran sigAlgebra ∧ 𝑇 = 𝑇))
493, 47, 48sylanblrc 591 . . . . . . 7 (𝜑𝑇 ∈ (sigAlgebra‘ 𝑇))
50 baselsiga 34299 . . . . . . 7 (𝑇 ∈ (sigAlgebra‘ 𝑇) → 𝑇𝑇)
5149, 50syl 17 . . . . . 6 (𝜑 𝑇𝑇)
5251adantr 480 . . . . 5 ((𝜑𝑎𝑆) → 𝑇𝑇)
53 elsx 34378 . . . . 5 (((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) ∧ (𝑎𝑆 𝑇𝑇)) → (𝑎 × 𝑇) ∈ (𝑆 ×s 𝑇))
5444, 45, 46, 52, 53syl22anc 839 . . . 4 ((𝜑𝑎𝑆) → (𝑎 × 𝑇) ∈ (𝑆 ×s 𝑇))
5543, 54eqeltrd 2837 . . 3 ((𝜑𝑎𝑆) → ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5655ralrimiva 3130 . 2 (𝜑 → ∀𝑎𝑆 ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5711, 2ismbfm 34435 . 2 (𝜑 → ((1st ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑆) ↔ ((1st ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑆m (𝑆 ×s 𝑇)) ∧ ∀𝑎𝑆 ((1st ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))))
5815, 56, 57mpbir2and 714 1 (𝜑 → (1st ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  wss 3903  𝒫 cpw 4556  cop 4588   cuni 4865   × cxp 5632  ccnv 5633  ran crn 5635  cres 5636  cima 5637   Fn wfn 6497  wf 6498  cfv 6502  (class class class)co 7370  1st c1st 7943  2nd c2nd 7944  m cmap 8777  sigAlgebracsiga 34292   ×s csx 34372  MblFnMcmbfm 34433
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-1st 7945  df-2nd 7946  df-map 8779  df-siga 34293  df-sigagen 34323  df-sx 34373  df-mbfm 34434
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator