| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnmrc | Structured version Visualization version GIF version | ||
| Description: Moore-closure is a well-behaved function. (Contributed by Stefan O'Rear, 1-Feb-2015.) |
| Ref | Expression |
|---|---|
| fnmrc | ⊢ mrCls Fn ∪ ran Moore |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-mrc 17520 | . . 3 ⊢ mrCls = (𝑐 ∈ ∪ ran Moore ↦ (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠})) | |
| 2 | 1 | fnmpt 6642 | . 2 ⊢ (∀𝑐 ∈ ∪ ran Moore(𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V → mrCls Fn ∪ ran Moore) |
| 3 | mreunirn 17534 | . . 3 ⊢ (𝑐 ∈ ∪ ran Moore ↔ 𝑐 ∈ (Moore‘∪ 𝑐)) | |
| 4 | mrcflem 17543 | . . . . 5 ⊢ (𝑐 ∈ (Moore‘∪ 𝑐) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}):𝒫 ∪ 𝑐⟶𝑐) | |
| 5 | fssxp 6699 | . . . . 5 ⊢ ((𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}):𝒫 ∪ 𝑐⟶𝑐 → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ⊆ (𝒫 ∪ 𝑐 × 𝑐)) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝑐 ∈ (Moore‘∪ 𝑐) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ⊆ (𝒫 ∪ 𝑐 × 𝑐)) |
| 7 | vuniex 7696 | . . . . . 6 ⊢ ∪ 𝑐 ∈ V | |
| 8 | 7 | pwex 5329 | . . . . 5 ⊢ 𝒫 ∪ 𝑐 ∈ V |
| 9 | vex 3446 | . . . . 5 ⊢ 𝑐 ∈ V | |
| 10 | 8, 9 | xpex 7710 | . . . 4 ⊢ (𝒫 ∪ 𝑐 × 𝑐) ∈ V |
| 11 | ssexg 5272 | . . . 4 ⊢ (((𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ⊆ (𝒫 ∪ 𝑐 × 𝑐) ∧ (𝒫 ∪ 𝑐 × 𝑐) ∈ V) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V) | |
| 12 | 6, 10, 11 | sylancl 587 | . . 3 ⊢ (𝑐 ∈ (Moore‘∪ 𝑐) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V) |
| 13 | 3, 12 | sylbi 217 | . 2 ⊢ (𝑐 ∈ ∪ ran Moore → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V) |
| 14 | 2, 13 | mprg 3058 | 1 ⊢ mrCls Fn ∪ ran Moore |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 {crab 3401 Vcvv 3442 ⊆ wss 3903 𝒫 cpw 4556 ∪ cuni 4865 ∩ cint 4904 ↦ cmpt 5181 × cxp 5632 ran crn 5635 Fn wfn 6497 ⟶wf 6498 ‘cfv 6502 Moorecmre 17515 mrClscmrc 17516 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-fv 6510 df-mre 17519 df-mrc 17520 |
| This theorem is referenced by: ismrc 43087 |
| Copyright terms: Public domain | W3C validator |