Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > elunirnmbfm | Structured version Visualization version GIF version |
Description: The property of being a measurable function. (Contributed by Thierry Arnoux, 23-Jan-2017.) |
Ref | Expression |
---|---|
elunirnmbfm | ⊢ (𝐹 ∈ ∪ ran MblFnM ↔ ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra(𝐹 ∈ (∪ 𝑡 ↑m ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mbfm 31408 | . . . . 5 ⊢ MblFnM = (𝑠 ∈ ∪ ran sigAlgebra, 𝑡 ∈ ∪ ran sigAlgebra ↦ {𝑓 ∈ (∪ 𝑡 ↑m ∪ 𝑠) ∣ ∀𝑥 ∈ 𝑡 (◡𝑓 “ 𝑥) ∈ 𝑠}) | |
2 | 1 | mpofun 7265 | . . . 4 ⊢ Fun MblFnM |
3 | elunirn 7001 | . . . 4 ⊢ (Fun MblFnM → (𝐹 ∈ ∪ ran MblFnM ↔ ∃𝑎 ∈ dom MblFnM𝐹 ∈ (MblFnM‘𝑎))) | |
4 | 2, 3 | ax-mp 5 | . . 3 ⊢ (𝐹 ∈ ∪ ran MblFnM ↔ ∃𝑎 ∈ dom MblFnM𝐹 ∈ (MblFnM‘𝑎)) |
5 | ovex 7178 | . . . . . 6 ⊢ (∪ 𝑡 ↑m ∪ 𝑠) ∈ V | |
6 | 5 | rabex 5226 | . . . . 5 ⊢ {𝑓 ∈ (∪ 𝑡 ↑m ∪ 𝑠) ∣ ∀𝑥 ∈ 𝑡 (◡𝑓 “ 𝑥) ∈ 𝑠} ∈ V |
7 | 1, 6 | dmmpo 7758 | . . . 4 ⊢ dom MblFnM = (∪ ran sigAlgebra × ∪ ran sigAlgebra) |
8 | 7 | rexeqi 3412 | . . 3 ⊢ (∃𝑎 ∈ dom MblFnM𝐹 ∈ (MblFnM‘𝑎) ↔ ∃𝑎 ∈ (∪ ran sigAlgebra × ∪ ran sigAlgebra)𝐹 ∈ (MblFnM‘𝑎)) |
9 | fveq2 6663 | . . . . . 6 ⊢ (𝑎 = 〈𝑠, 𝑡〉 → (MblFnM‘𝑎) = (MblFnM‘〈𝑠, 𝑡〉)) | |
10 | df-ov 7148 | . . . . . 6 ⊢ (𝑠MblFnM𝑡) = (MblFnM‘〈𝑠, 𝑡〉) | |
11 | 9, 10 | syl6eqr 2871 | . . . . 5 ⊢ (𝑎 = 〈𝑠, 𝑡〉 → (MblFnM‘𝑎) = (𝑠MblFnM𝑡)) |
12 | 11 | eleq2d 2895 | . . . 4 ⊢ (𝑎 = 〈𝑠, 𝑡〉 → (𝐹 ∈ (MblFnM‘𝑎) ↔ 𝐹 ∈ (𝑠MblFnM𝑡))) |
13 | 12 | rexxp 5706 | . . 3 ⊢ (∃𝑎 ∈ (∪ ran sigAlgebra × ∪ ran sigAlgebra)𝐹 ∈ (MblFnM‘𝑎) ↔ ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra𝐹 ∈ (𝑠MblFnM𝑡)) |
14 | 4, 8, 13 | 3bitri 298 | . 2 ⊢ (𝐹 ∈ ∪ ran MblFnM ↔ ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra𝐹 ∈ (𝑠MblFnM𝑡)) |
15 | simpl 483 | . . . 4 ⊢ ((𝑠 ∈ ∪ ran sigAlgebra ∧ 𝑡 ∈ ∪ ran sigAlgebra) → 𝑠 ∈ ∪ ran sigAlgebra) | |
16 | simpr 485 | . . . 4 ⊢ ((𝑠 ∈ ∪ ran sigAlgebra ∧ 𝑡 ∈ ∪ ran sigAlgebra) → 𝑡 ∈ ∪ ran sigAlgebra) | |
17 | 15, 16 | ismbfm 31409 | . . 3 ⊢ ((𝑠 ∈ ∪ ran sigAlgebra ∧ 𝑡 ∈ ∪ ran sigAlgebra) → (𝐹 ∈ (𝑠MblFnM𝑡) ↔ (𝐹 ∈ (∪ 𝑡 ↑m ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠))) |
18 | 17 | 2rexbiia 3295 | . 2 ⊢ (∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra𝐹 ∈ (𝑠MblFnM𝑡) ↔ ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra(𝐹 ∈ (∪ 𝑡 ↑m ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠)) |
19 | 14, 18 | bitri 276 | 1 ⊢ (𝐹 ∈ ∪ ran MblFnM ↔ ∃𝑠 ∈ ∪ ran sigAlgebra∃𝑡 ∈ ∪ ran sigAlgebra(𝐹 ∈ (∪ 𝑡 ↑m ∪ 𝑠) ∧ ∀𝑥 ∈ 𝑡 (◡𝐹 “ 𝑥) ∈ 𝑠)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ∀wral 3135 ∃wrex 3136 {crab 3139 〈cop 4563 ∪ cuni 4830 × cxp 5546 ◡ccnv 5547 dom cdm 5548 ran crn 5549 “ cima 5551 Fun wfun 6342 ‘cfv 6348 (class class class)co 7145 ↑m cmap 8395 sigAlgebracsiga 31266 MblFnMcmbfm 31407 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-fv 6356 df-ov 7148 df-oprab 7149 df-mpo 7150 df-1st 7678 df-2nd 7679 df-mbfm 31408 |
This theorem is referenced by: mbfmfun 31411 isanmbfm 31413 |
Copyright terms: Public domain | W3C validator |