| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mreexdomd | Structured version Visualization version GIF version | ||
| Description: In a Moore system whose closure operator has the exchange property, if 𝑆 is independent and contained in the closure of 𝑇, and either 𝑆 or 𝑇 is finite, then 𝑇 dominates 𝑆. This is an immediate consequence of mreexexd 17571. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| mreexdomd.1 | ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) |
| mreexdomd.2 | ⊢ 𝑁 = (mrCls‘𝐴) |
| mreexdomd.3 | ⊢ 𝐼 = (mrInd‘𝐴) |
| mreexdomd.4 | ⊢ (𝜑 → ∀𝑠 ∈ 𝒫 𝑋∀𝑦 ∈ 𝑋 ∀𝑧 ∈ ((𝑁‘(𝑠 ∪ {𝑦})) ∖ (𝑁‘𝑠))𝑦 ∈ (𝑁‘(𝑠 ∪ {𝑧}))) |
| mreexdomd.5 | ⊢ (𝜑 → 𝑆 ⊆ (𝑁‘𝑇)) |
| mreexdomd.6 | ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
| mreexdomd.7 | ⊢ (𝜑 → (𝑆 ∈ Fin ∨ 𝑇 ∈ Fin)) |
| mreexdomd.8 | ⊢ (𝜑 → 𝑆 ∈ 𝐼) |
| Ref | Expression |
|---|---|
| mreexdomd | ⊢ (𝜑 → 𝑆 ≼ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mreexdomd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) | |
| 2 | mreexdomd.2 | . . 3 ⊢ 𝑁 = (mrCls‘𝐴) | |
| 3 | mreexdomd.3 | . . 3 ⊢ 𝐼 = (mrInd‘𝐴) | |
| 4 | mreexdomd.4 | . . 3 ⊢ (𝜑 → ∀𝑠 ∈ 𝒫 𝑋∀𝑦 ∈ 𝑋 ∀𝑧 ∈ ((𝑁‘(𝑠 ∪ {𝑦})) ∖ (𝑁‘𝑠))𝑦 ∈ (𝑁‘(𝑠 ∪ {𝑧}))) | |
| 5 | mreexdomd.8 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐼) | |
| 6 | 3, 1, 5 | mrissd 17559 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 7 | dif0 4330 | . . . 4 ⊢ (𝑋 ∖ ∅) = 𝑋 | |
| 8 | 6, 7 | sseqtrrdi 3975 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (𝑋 ∖ ∅)) |
| 9 | mreexdomd.6 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) | |
| 10 | 9, 7 | sseqtrrdi 3975 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ (𝑋 ∖ ∅)) |
| 11 | mreexdomd.5 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ (𝑁‘𝑇)) | |
| 12 | un0 4346 | . . . . 5 ⊢ (𝑇 ∪ ∅) = 𝑇 | |
| 13 | 12 | fveq2i 6837 | . . . 4 ⊢ (𝑁‘(𝑇 ∪ ∅)) = (𝑁‘𝑇) |
| 14 | 11, 13 | sseqtrrdi 3975 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (𝑁‘(𝑇 ∪ ∅))) |
| 15 | un0 4346 | . . . 4 ⊢ (𝑆 ∪ ∅) = 𝑆 | |
| 16 | 15, 5 | eqeltrid 2840 | . . 3 ⊢ (𝜑 → (𝑆 ∪ ∅) ∈ 𝐼) |
| 17 | mreexdomd.7 | . . 3 ⊢ (𝜑 → (𝑆 ∈ Fin ∨ 𝑇 ∈ Fin)) | |
| 18 | 1, 2, 3, 4, 8, 10, 14, 16, 17 | mreexexd 17571 | . 2 ⊢ (𝜑 → ∃𝑖 ∈ 𝒫 𝑇(𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼)) |
| 19 | simprrl 780 | . . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑆 ≈ 𝑖) | |
| 20 | simprl 770 | . . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑖 ∈ 𝒫 𝑇) | |
| 21 | 20 | elpwid 4563 | . . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑖 ⊆ 𝑇) |
| 22 | 1 | elfvexd 6870 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ V) |
| 23 | 22, 9 | ssexd 5269 | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ V) |
| 24 | ssdomg 8937 | . . . . . 6 ⊢ (𝑇 ∈ V → (𝑖 ⊆ 𝑇 → 𝑖 ≼ 𝑇)) | |
| 25 | 23, 24 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑖 ⊆ 𝑇 → 𝑖 ≼ 𝑇)) |
| 26 | 25 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → (𝑖 ⊆ 𝑇 → 𝑖 ≼ 𝑇)) |
| 27 | 21, 26 | mpd 15 | . . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑖 ≼ 𝑇) |
| 28 | endomtr 8949 | . . 3 ⊢ ((𝑆 ≈ 𝑖 ∧ 𝑖 ≼ 𝑇) → 𝑆 ≼ 𝑇) | |
| 29 | 19, 27, 28 | syl2anc 584 | . 2 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑆 ≼ 𝑇) |
| 30 | 18, 29 | rexlimddv 3143 | 1 ⊢ (𝜑 → 𝑆 ≼ 𝑇) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 ∖ cdif 3898 ∪ cun 3899 ⊆ wss 3901 ∅c0 4285 𝒫 cpw 4554 {csn 4580 class class class wbr 5098 ‘cfv 6492 ≈ cen 8880 ≼ cdom 8881 Fincfn 8883 Moorecmre 17501 mrClscmrc 17502 mrIndcmri 17503 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-om 7809 df-1o 8397 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9851 df-mre 17505 df-mrc 17506 df-mri 17507 |
| This theorem is referenced by: mreexfidimd 17573 |
| Copyright terms: Public domain | W3C validator |