| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mrcval | Structured version Visualization version GIF version | ||
| Description: Evaluation of the Moore closure of a set. (Contributed by Stefan O'Rear, 31-Jan-2015.) (Proof shortened by Fan Zheng, 6-Jun-2016.) |
| Ref | Expression |
|---|---|
| mrcfval.f | ⊢ 𝐹 = (mrCls‘𝐶) |
| Ref | Expression |
|---|---|
| mrcval | ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → (𝐹‘𝑈) = ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mrcfval.f | . . . 4 ⊢ 𝐹 = (mrCls‘𝐶) | |
| 2 | 1 | mrcfval 17620 | . . 3 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹 = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑠 ∈ 𝐶 ∣ 𝑥 ⊆ 𝑠})) |
| 3 | 2 | adantr 480 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → 𝐹 = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑠 ∈ 𝐶 ∣ 𝑥 ⊆ 𝑠})) |
| 4 | sseq1 3984 | . . . . 5 ⊢ (𝑥 = 𝑈 → (𝑥 ⊆ 𝑠 ↔ 𝑈 ⊆ 𝑠)) | |
| 5 | 4 | rabbidv 3423 | . . . 4 ⊢ (𝑥 = 𝑈 → {𝑠 ∈ 𝐶 ∣ 𝑥 ⊆ 𝑠} = {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠}) |
| 6 | 5 | inteqd 4927 | . . 3 ⊢ (𝑥 = 𝑈 → ∩ {𝑠 ∈ 𝐶 ∣ 𝑥 ⊆ 𝑠} = ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠}) |
| 7 | 6 | adantl 481 | . 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) ∧ 𝑥 = 𝑈) → ∩ {𝑠 ∈ 𝐶 ∣ 𝑥 ⊆ 𝑠} = ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠}) |
| 8 | mre1cl 17606 | . . . 4 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝑋 ∈ 𝐶) | |
| 9 | elpw2g 5303 | . . . 4 ⊢ (𝑋 ∈ 𝐶 → (𝑈 ∈ 𝒫 𝑋 ↔ 𝑈 ⊆ 𝑋)) | |
| 10 | 8, 9 | syl 17 | . . 3 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝑈 ∈ 𝒫 𝑋 ↔ 𝑈 ⊆ 𝑋)) |
| 11 | 10 | biimpar 477 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → 𝑈 ∈ 𝒫 𝑋) |
| 12 | sseq2 3985 | . . . . 5 ⊢ (𝑠 = 𝑋 → (𝑈 ⊆ 𝑠 ↔ 𝑈 ⊆ 𝑋)) | |
| 13 | 8 | adantr 480 | . . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → 𝑋 ∈ 𝐶) |
| 14 | simpr 484 | . . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → 𝑈 ⊆ 𝑋) | |
| 15 | 12, 13, 14 | elrabd 3673 | . . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → 𝑋 ∈ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠}) |
| 16 | 15 | ne0d 4317 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ≠ ∅) |
| 17 | intex 5314 | . . 3 ⊢ ({𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ≠ ∅ ↔ ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ∈ V) | |
| 18 | 16, 17 | sylib 218 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ∈ V) |
| 19 | 3, 7, 11, 18 | fvmptd 6993 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → (𝐹‘𝑈) = ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 {crab 3415 Vcvv 3459 ⊆ wss 3926 ∅c0 4308 𝒫 cpw 4575 ∩ cint 4922 ↦ cmpt 5201 ‘cfv 6531 Moorecmre 17594 mrClscmrc 17595 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-mre 17598 df-mrc 17599 |
| This theorem is referenced by: mrcid 17625 mrcss 17628 mrcssid 17629 cycsubg2 19193 aspval2 21858 mrelatlubALT 48969 mreclat 48971 |
| Copyright terms: Public domain | W3C validator |