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 34716
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 8017 . . . 4 (2nd ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑇
2 1stmbfm.1 . . . . . 6 (𝜑𝑆 ran sigAlgebra)
3 1stmbfm.2 . . . . . 6 (𝜑𝑇 ran sigAlgebra)
4 sxuni 34648 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
52, 3, 4syl2anc 596 . . . . 5 (𝜑 → ( 𝑆 × 𝑇) = (𝑆 ×s 𝑇))
65feq2d 6693 . . . 4 (𝜑 → ((2nd ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑇 ↔ (2nd ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑇))
71, 6mpbii 236 . . 3 (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑇)
8 unielsiga 34582 . . . . 5 (𝑇 ran sigAlgebra → 𝑇𝑇)
93, 8syl 18 . . . 4 (𝜑 𝑇𝑇)
10 sxsiga 34646 . . . . . 6 ((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
112, 3, 10syl2anc 596 . . . . 5 (𝜑 → (𝑆 ×s 𝑇) ∈ ran sigAlgebra)
12 unielsiga 34582 . . . . 5 ((𝑆 ×s 𝑇) ∈ ran sigAlgebra → (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
1311, 12syl 18 . . . 4 (𝜑 (𝑆 ×s 𝑇) ∈ (𝑆 ×s 𝑇))
149, 13elmapd 8843 . . 3 (𝜑 → ((2nd ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑇m (𝑆 ×s 𝑇)) ↔ (2nd ↾ ( 𝑆 × 𝑇)): (𝑆 ×s 𝑇)⟶ 𝑇))
157, 14mpbird 260 . 2 (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑇m (𝑆 ×s 𝑇)))
16 ffn 6709 . . . . . . . 8 ((2nd ↾ ( 𝑆 × 𝑇)):( 𝑆 × 𝑇)⟶ 𝑇 → (2nd ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇))
17 elpreima 7057 . . . . . . . 8 ((2nd ↾ ( 𝑆 × 𝑇)) Fn ( 𝑆 × 𝑇) → (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎)))
181, 16, 17mp2b 10 . . . . . . 7 (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎))
19 fvres 6904 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) = (2nd𝑧))
2019eleq1d 2850 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎 ↔ (2nd𝑧) ∈ 𝑎))
21 1st2nd2 8031 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
22 xp1st 8024 . . . . . . . . . 10 (𝑧 ∈ ( 𝑆 × 𝑇) → (1st𝑧) ∈ 𝑆)
23 elxp6 8026 . . . . . . . . . . . 12 (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑎)))
24 anass 474 . . . . . . . . . . . 12 (((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑆) ∧ (2nd𝑧) ∈ 𝑎) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑎)))
2523, 24bitr4i 281 . . . . . . . . . . 11 (𝑧 ∈ ( 𝑆 × 𝑎) ↔ ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑆) ∧ (2nd𝑧) ∈ 𝑎))
2625baib 545 . . . . . . . . . 10 ((𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ (1st𝑧) ∈ 𝑆) → (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (2nd𝑧) ∈ 𝑎))
2721, 22, 26syl2anc 596 . . . . . . . . 9 (𝑧 ∈ ( 𝑆 × 𝑇) → (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (2nd𝑧) ∈ 𝑎))
2820, 27bitr4d 285 . . . . . . . 8 (𝑧 ∈ ( 𝑆 × 𝑇) → (((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎𝑧 ∈ ( 𝑆 × 𝑎)))
2928pm5.32i 585 . . . . . . 7 ((𝑧 ∈ ( 𝑆 × 𝑇) ∧ ((2nd ↾ ( 𝑆 × 𝑇))‘𝑧) ∈ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ ( 𝑆 × 𝑎)))
3018, 29bitri 278 . . . . . 6 (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ ( 𝑆 × 𝑎)))
31 sgon 34578 . . . . . . . . . . 11 (𝑇 ran sigAlgebra → 𝑇 ∈ (sigAlgebra‘ 𝑇))
32 sigasspw 34570 . . . . . . . . . . 11 (𝑇 ∈ (sigAlgebra‘ 𝑇) → 𝑇 ⊆ 𝒫 𝑇)
33 pwssb 5069 . . . . . . . . . . . 12 (𝑇 ⊆ 𝒫 𝑇 ↔ ∀𝑎𝑇 𝑎 𝑇)
3433biimpi 219 . . . . . . . . . . 11 (𝑇 ⊆ 𝒫 𝑇 → ∀𝑎𝑇 𝑎 𝑇)
353, 31, 32, 344syl 20 . . . . . . . . . 10 (𝜑 → ∀𝑎𝑇 𝑎 𝑇)
3635r19.21bi 3259 . . . . . . . . 9 ((𝜑𝑎𝑇) → 𝑎 𝑇)
37 xpss2 5683 . . . . . . . . 9 (𝑎 𝑇 → ( 𝑆 × 𝑎) ⊆ ( 𝑆 × 𝑇))
3836, 37syl 18 . . . . . . . 8 ((𝜑𝑎𝑇) → ( 𝑆 × 𝑎) ⊆ ( 𝑆 × 𝑇))
3938sseld 3937 . . . . . . 7 ((𝜑𝑎𝑇) → (𝑧 ∈ ( 𝑆 × 𝑎) → 𝑧 ∈ ( 𝑆 × 𝑇)))
4039pm4.71rd 572 . . . . . 6 ((𝜑𝑎𝑇) → (𝑧 ∈ ( 𝑆 × 𝑎) ↔ (𝑧 ∈ ( 𝑆 × 𝑇) ∧ 𝑧 ∈ ( 𝑆 × 𝑎))))
4130, 40bitr4id 293 . . . . 5 ((𝜑𝑎𝑇) → (𝑧 ∈ ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ↔ 𝑧 ∈ ( 𝑆 × 𝑎)))
4241eqrdv 2763 . . . 4 ((𝜑𝑎𝑇) → ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) = ( 𝑆 × 𝑎))
432adantr 486 . . . . 5 ((𝜑𝑎𝑇) → 𝑆 ran sigAlgebra)
443adantr 486 . . . . 5 ((𝜑𝑎𝑇) → 𝑇 ran sigAlgebra)
45 eqid 2765 . . . . . . . 8 𝑆 = 𝑆
46 issgon 34577 . . . . . . . 8 (𝑆 ∈ (sigAlgebra‘ 𝑆) ↔ (𝑆 ran sigAlgebra ∧ 𝑆 = 𝑆))
472, 45, 46sylanblrc 602 . . . . . . 7 (𝜑𝑆 ∈ (sigAlgebra‘ 𝑆))
48 baselsiga 34569 . . . . . . 7 (𝑆 ∈ (sigAlgebra‘ 𝑆) → 𝑆𝑆)
4947, 48syl 18 . . . . . 6 (𝜑 𝑆𝑆)
5049adantr 486 . . . . 5 ((𝜑𝑎𝑇) → 𝑆𝑆)
51 simpr 490 . . . . 5 ((𝜑𝑎𝑇) → 𝑎𝑇)
52 elsx 34649 . . . . 5 (((𝑆 ran sigAlgebra ∧ 𝑇 ran sigAlgebra) ∧ ( 𝑆𝑆𝑎𝑇)) → ( 𝑆 × 𝑎) ∈ (𝑆 ×s 𝑇))
5343, 44, 50, 51, 52syl22anc 852 . . . 4 ((𝜑𝑎𝑇) → ( 𝑆 × 𝑎) ∈ (𝑆 ×s 𝑇))
5442, 53eqeltrd 2865 . . 3 ((𝜑𝑎𝑇) → ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5554ralrimiva 3159 . 2 (𝜑 → ∀𝑎𝑇 ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))
5611, 3ismbfm 34706 . 2 (𝜑 → ((2nd ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑇) ↔ ((2nd ↾ ( 𝑆 × 𝑇)) ∈ ( 𝑇m (𝑆 ×s 𝑇)) ∧ ∀𝑎𝑇 ((2nd ↾ ( 𝑆 × 𝑇)) “ 𝑎) ∈ (𝑆 ×s 𝑇))))
5715, 55, 56mpbir2and 726 1 (𝜑 → (2nd ↾ ( 𝑆 × 𝑇)) ∈ ((𝑆 ×s 𝑇)MblFnM𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wral 3081  wss 3906  𝒫 cpw 4564  cop 4597   cuni 4874   × cxp 5661  ccnv 5662  ran crn 5664  cres 5665  cima 5666   Fn wfn 6535  wf 6536  cfv 6540  (class class class)co 7419  1st c1st 7990  2nd c2nd 7991  m cmap 8830  sigAlgebracsiga 34562   ×s csx 34643  MblFnMcmbfm 34704
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  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 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-map 8832  df-siga 34563  df-sigagen 34594  df-sx 34644  df-mbfm 34705
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator