| 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 17675 | . . 3 ⊢ mrCls = (𝑐 ∈ ∪ ran Moore ↦ (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠})) | |
| 2 | 1 | fnmpt 6676 | . 2 ⊢ (∀𝑐 ∈ ∪ ran Moore(𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V → mrCls Fn ∪ ran Moore) |
| 3 | mreunirn 17689 | . . 3 ⊢ (𝑐 ∈ ∪ ran Moore ↔ 𝑐 ∈ (Moore‘∪ 𝑐)) | |
| 4 | mrcflem 17698 | . . . . 5 ⊢ (𝑐 ∈ (Moore‘∪ 𝑐) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}):𝒫 ∪ 𝑐⟶𝑐) | |
| 5 | fssxp 6734 | . . . . 5 ⊢ ((𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}):𝒫 ∪ 𝑐⟶𝑐 → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ⊆ (𝒫 ∪ 𝑐 × 𝑐)) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝑐 ∈ (Moore‘∪ 𝑐) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ⊆ (𝒫 ∪ 𝑐 × 𝑐)) |
| 7 | vuniex 7744 | . . . . . 6 ⊢ ∪ 𝑐 ∈ V | |
| 8 | 7 | pwex 5349 | . . . . 5 ⊢ 𝒫 ∪ 𝑐 ∈ V |
| 9 | vex 3457 | . . . . 5 ⊢ 𝑐 ∈ V | |
| 10 | 8, 9 | xpex 7755 | . . . 4 ⊢ (𝒫 ∪ 𝑐 × 𝑐) ∈ V |
| 11 | ssexg 5288 | . . . 4 ⊢ (((𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ⊆ (𝒫 ∪ 𝑐 × 𝑐) ∧ (𝒫 ∪ 𝑐 × 𝑐) ∈ V) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V) | |
| 12 | 6, 10, 11 | sylancl 598 | . . 3 ⊢ (𝑐 ∈ (Moore‘∪ 𝑐) → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V) |
| 13 | 3, 12 | sylbi 220 | . 2 ⊢ (𝑐 ∈ ∪ ran Moore → (𝑥 ∈ 𝒫 ∪ 𝑐 ↦ ∩ {𝑠 ∈ 𝑐 ∣ 𝑥 ⊆ 𝑠}) ∈ V) |
| 14 | 2, 13 | mprg 3084 | 1 ⊢ mrCls Fn ∪ ran Moore |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 {crab 3414 Vcvv 3453 ⊆ wss 3902 𝒫 cpw 4560 ∪ cuni 4870 ∩ cint 4910 ↦ cmpt 5190 × cxp 5657 ran crn 5660 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 Moorecmre 17670 mrClscmrc 17671 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-mre 17674 df-mrc 17675 |
| This theorem is used by: ismrc 43533 |
| Copyright terms: Public domain | W3C validator |