| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > issalnnd | Structured version Visualization version GIF version | ||
| Description: Sufficient condition to prove that 𝑆 is sigma-algebra. (Contributed by Glauco Siliprandi, 3-Mar-2021.) |
| Ref | Expression |
|---|---|
| issalnnd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| issalnnd.z | ⊢ (𝜑 → ∅ ∈ 𝑆) |
| issalnnd.x | ⊢ 𝑋 = ∪ 𝑆 |
| issalnnd.d | ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝑋 ∖ 𝑦) ∈ 𝑆) |
| issalnnd.i | ⊢ ((𝜑 ∧ 𝑒:ℕ⟶𝑆) → ∪ 𝑛 ∈ ℕ (𝑒‘𝑛) ∈ 𝑆) |
| Ref | Expression |
|---|---|
| issalnnd | ⊢ (𝜑 → 𝑆 ∈ SAlg) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | issalnnd.s | . 2 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 2 | issalnnd.z | . 2 ⊢ (𝜑 → ∅ ∈ 𝑆) | |
| 3 | issalnnd.x | . 2 ⊢ 𝑋 = ∪ 𝑆 | |
| 4 | issalnnd.d | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → (𝑋 ∖ 𝑦) ∈ 𝑆) | |
| 5 | unieq 4878 | . . . . . . 7 ⊢ (𝑦 = ∅ → ∪ 𝑦 = ∪ ∅) | |
| 6 | uni0 4896 | . . . . . . . 8 ⊢ ∪ ∅ = ∅ | |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝑦 = ∅ → ∪ ∅ = ∅) |
| 8 | 5, 7 | eqtrd 2795 | . . . . . 6 ⊢ (𝑦 = ∅ → ∪ 𝑦 = ∅) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 = ∅) → ∪ 𝑦 = ∅) |
| 10 | 2 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 = ∅) → ∅ ∈ 𝑆) |
| 11 | 9, 10 | eqeltrd 2860 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 = ∅) → ∪ 𝑦 ∈ 𝑆) |
| 12 | 11 | 3ad2antl1 1204 | . . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 = ∅) → ∪ 𝑦 ∈ 𝑆) |
| 13 | neqne 2963 | . . . . 5 ⊢ (¬ 𝑦 = ∅ → 𝑦 ≠ ∅) | |
| 14 | 13 | adantl 487 | . . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ ¬ 𝑦 = ∅) → 𝑦 ≠ ∅) |
| 15 | nnfoctb 45980 | . . . . . 6 ⊢ ((𝑦 ≼ ω ∧ 𝑦 ≠ ∅) → ∃𝑒 𝑒:ℕ–onto→𝑦) | |
| 16 | 15 | 3ad2antl3 1206 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → ∃𝑒 𝑒:ℕ–onto→𝑦) |
| 17 | founiiun 46109 | . . . . . . . . . . 11 ⊢ (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 = ∪ 𝑛 ∈ ℕ (𝑒‘𝑛)) | |
| 18 | 17 | adantl 487 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → ∪ 𝑦 = ∪ 𝑛 ∈ ℕ (𝑒‘𝑛)) |
| 19 | simpll 779 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → 𝜑) | |
| 20 | fof 6785 | . . . . . . . . . . . . . 14 ⊢ (𝑒:ℕ–onto→𝑦 → 𝑒:ℕ⟶𝑦) | |
| 21 | 20 | adantl 487 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝒫 𝑆 ∧ 𝑒:ℕ–onto→𝑦) → 𝑒:ℕ⟶𝑦) |
| 22 | elpwi 4564 | . . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝒫 𝑆 → 𝑦 ⊆ 𝑆) | |
| 23 | 22 | adantr 486 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝒫 𝑆 ∧ 𝑒:ℕ–onto→𝑦) → 𝑦 ⊆ 𝑆) |
| 24 | 21, 23 | fssd 6716 | . . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝒫 𝑆 ∧ 𝑒:ℕ–onto→𝑦) → 𝑒:ℕ⟶𝑆) |
| 25 | 24 | adantll 727 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → 𝑒:ℕ⟶𝑆) |
| 26 | issalnnd.i | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑒:ℕ⟶𝑆) → ∪ 𝑛 ∈ ℕ (𝑒‘𝑛) ∈ 𝑆) | |
| 27 | 19, 25, 26 | syl2anc 596 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → ∪ 𝑛 ∈ ℕ (𝑒‘𝑛) ∈ 𝑆) |
| 28 | 18, 27 | eqeltrd 2860 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → ∪ 𝑦 ∈ 𝑆) |
| 29 | 28 | ex 418 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) → (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 30 | 29 | adantr 486 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑦 ≠ ∅) → (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 31 | 30 | 3adantl3 1187 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 32 | 31 | exlimdv 1966 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → (∃𝑒 𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 33 | 16, 32 | mpd 16 | . . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → ∪ 𝑦 ∈ 𝑆) |
| 34 | 14, 33 | syldan 603 | . . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ ¬ 𝑦 = ∅) → ∪ 𝑦 ∈ 𝑆) |
| 35 | 12, 34 | pm2.61dan 825 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) → ∪ 𝑦 ∈ 𝑆) |
| 36 | 1, 2, 3, 4, 35 | issald 47259 | 1 ⊢ (𝜑 → 𝑆 ∈ SAlg) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2955 ∖ cdif 3896 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 ∪ cuni 4867 ∪ ciun 4951 class class class wbr 5103 ⟶wf 6524 –onto→wfo 6526 ‘cfv 6528 ωcom 7861 ≼ cdom 8950 ℕcn 12290 SAlgcsalg 47234 |
| 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-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-inf2 9620 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 |
| 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-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-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-n0 12562 df-z 12649 df-uz 12921 df-salg 47235 |
| This theorem is used by: dmvolsal 47272 subsalsal 47285 smfresal 47714 |
| Copyright terms: Public domain | W3C validator |