| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sigaclcu3 | Structured version Visualization version GIF version | ||
| Description: A sigma-algebra is closed under countable or finite union. (Contributed by Thierry Arnoux, 6-Mar-2017.) |
| Ref | Expression |
|---|---|
| sigaclcu3.1 | ⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra) |
| sigaclcu3.2 | ⊢ (𝜑 → (𝑁 = ℕ ∨ 𝑁 = (1..^𝑀))) |
| sigaclcu3.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| sigaclcu3 | ⊢ (𝜑 → ∪ 𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → 𝑁 = ℕ) | |
| 2 | 1 | iuneq1d 4979 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → ∪ 𝑘 ∈ 𝑁 𝐴 = ∪ 𝑘 ∈ ℕ 𝐴) |
| 3 | sigaclcu3.1 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra) | |
| 4 | 3 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → 𝑆 ∈ ∪ ran sigAlgebra) |
| 5 | sigaclcu3.3 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑁) → 𝐴 ∈ 𝑆) | |
| 6 | 5 | ralrimiva 3154 | . . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| 7 | 6 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → ∀𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| 8 | 7, 1 | raleqtrdv 3321 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → ∀𝑘 ∈ ℕ 𝐴 ∈ 𝑆) |
| 9 | sigaclcu2 34630 | . . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ ∀𝑘 ∈ ℕ 𝐴 ∈ 𝑆) → ∪ 𝑘 ∈ ℕ 𝐴 ∈ 𝑆) | |
| 10 | 4, 8, 9 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → ∪ 𝑘 ∈ ℕ 𝐴 ∈ 𝑆) |
| 11 | 2, 10 | eqeltrd 2860 | . 2 ⊢ ((𝜑 ∧ 𝑁 = ℕ) → ∪ 𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| 12 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → 𝑁 = (1..^𝑀)) | |
| 13 | 12 | iuneq1d 4979 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → ∪ 𝑘 ∈ 𝑁 𝐴 = ∪ 𝑘 ∈ (1..^𝑀)𝐴) |
| 14 | 3 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → 𝑆 ∈ ∪ ran sigAlgebra) |
| 15 | 6 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → ∀𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| 16 | 15, 12 | raleqtrdv 3321 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → ∀𝑘 ∈ (1..^𝑀)𝐴 ∈ 𝑆) |
| 17 | sigaclfu2 34631 | . . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ ∀𝑘 ∈ (1..^𝑀)𝐴 ∈ 𝑆) → ∪ 𝑘 ∈ (1..^𝑀)𝐴 ∈ 𝑆) | |
| 18 | 14, 16, 17 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → ∪ 𝑘 ∈ (1..^𝑀)𝐴 ∈ 𝑆) |
| 19 | 13, 18 | eqeltrd 2860 | . 2 ⊢ ((𝜑 ∧ 𝑁 = (1..^𝑀)) → ∪ 𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| 20 | sigaclcu3.2 | . 2 ⊢ (𝜑 → (𝑁 = ℕ ∨ 𝑁 = (1..^𝑀))) | |
| 21 | 11, 19, 20 | mpjaodan 973 | 1 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝑁 𝐴 ∈ 𝑆) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∪ cuni 4867 ∪ ciun 4951 ran crn 5656 (class class class)co 7413 1c1 11125 ℕcn 12257 ..^cfzo 13709 sigAlgebracsiga 34618 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-card 9944 df-acn 9947 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-n0 12529 df-z 12616 df-uz 12888 df-fz 13562 df-fzo 13710 df-siga 34619 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |