| 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 4882 | . . . . . . 7 ⊢ (𝑦 = ∅ → ∪ 𝑦 = ∪ ∅) | |
| 6 | uni0 4899 | . . . . . . . 8 ⊢ ∪ ∅ = ∅ | |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝑦 = ∅ → ∪ ∅ = ∅) |
| 8 | 5, 7 | eqtrd 2764 | . . . . . 6 ⊢ (𝑦 = ∅ → ∪ 𝑦 = ∅) |
| 9 | 8 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 = ∅) → ∪ 𝑦 = ∅) |
| 10 | 2 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 = ∅) → ∅ ∈ 𝑆) |
| 11 | 9, 10 | eqeltrd 2828 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 = ∅) → ∪ 𝑦 ∈ 𝑆) |
| 12 | 11 | 3ad2antl1 1186 | . . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 = ∅) → ∪ 𝑦 ∈ 𝑆) |
| 13 | neqne 2933 | . . . . 5 ⊢ (¬ 𝑦 = ∅ → 𝑦 ≠ ∅) | |
| 14 | 13 | adantl 481 | . . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ ¬ 𝑦 = ∅) → 𝑦 ≠ ∅) |
| 15 | nnfoctb 45042 | . . . . . 6 ⊢ ((𝑦 ≼ ω ∧ 𝑦 ≠ ∅) → ∃𝑒 𝑒:ℕ–onto→𝑦) | |
| 16 | 15 | 3ad2antl3 1188 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → ∃𝑒 𝑒:ℕ–onto→𝑦) |
| 17 | founiiun 45173 | . . . . . . . . . . 11 ⊢ (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 = ∪ 𝑛 ∈ ℕ (𝑒‘𝑛)) | |
| 18 | 17 | adantl 481 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → ∪ 𝑦 = ∪ 𝑛 ∈ ℕ (𝑒‘𝑛)) |
| 19 | simpll 766 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → 𝜑) | |
| 20 | fof 6772 | . . . . . . . . . . . . . 14 ⊢ (𝑒:ℕ–onto→𝑦 → 𝑒:ℕ⟶𝑦) | |
| 21 | 20 | adantl 481 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝒫 𝑆 ∧ 𝑒:ℕ–onto→𝑦) → 𝑒:ℕ⟶𝑦) |
| 22 | elpwi 4570 | . . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝒫 𝑆 → 𝑦 ⊆ 𝑆) | |
| 23 | 22 | adantr 480 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝒫 𝑆 ∧ 𝑒:ℕ–onto→𝑦) → 𝑦 ⊆ 𝑆) |
| 24 | 21, 23 | fssd 6705 | . . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝒫 𝑆 ∧ 𝑒:ℕ–onto→𝑦) → 𝑒:ℕ⟶𝑆) |
| 25 | 24 | adantll 714 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → 𝑒:ℕ⟶𝑆) |
| 26 | issalnnd.i | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑒:ℕ⟶𝑆) → ∪ 𝑛 ∈ ℕ (𝑒‘𝑛) ∈ 𝑆) | |
| 27 | 19, 25, 26 | syl2anc 584 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → ∪ 𝑛 ∈ ℕ (𝑒‘𝑛) ∈ 𝑆) |
| 28 | 18, 27 | eqeltrd 2828 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑒:ℕ–onto→𝑦) → ∪ 𝑦 ∈ 𝑆) |
| 29 | 28 | ex 412 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) → (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 30 | 29 | adantr 480 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆) ∧ 𝑦 ≠ ∅) → (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 31 | 30 | 3adantl3 1169 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → (𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 32 | 31 | exlimdv 1933 | . . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → (∃𝑒 𝑒:ℕ–onto→𝑦 → ∪ 𝑦 ∈ 𝑆)) |
| 33 | 16, 32 | mpd 15 | . . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ 𝑦 ≠ ∅) → ∪ 𝑦 ∈ 𝑆) |
| 34 | 14, 33 | syldan 591 | . . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) ∧ ¬ 𝑦 = ∅) → ∪ 𝑦 ∈ 𝑆) |
| 35 | 12, 34 | pm2.61dan 812 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 𝑆 ∧ 𝑦 ≼ ω) → ∪ 𝑦 ∈ 𝑆) |
| 36 | 1, 2, 3, 4, 35 | issald 46331 | 1 ⊢ (𝜑 → 𝑆 ∈ SAlg) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2925 ∖ cdif 3911 ⊆ wss 3914 ∅c0 4296 𝒫 cpw 4563 ∪ cuni 4871 ∪ ciun 4955 class class class wbr 5107 ⟶wf 6507 –onto→wfo 6509 ‘cfv 6511 ωcom 7842 ≼ cdom 8916 ℕcn 12186 SAlgcsalg 46306 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-n0 12443 df-z 12530 df-uz 12794 df-salg 46307 |
| This theorem is referenced by: dmvolsal 46344 subsalsal 46357 smfresal 46786 |
| Copyright terms: Public domain | W3C validator |