![]() |
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 17527. (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 17515 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
7 | dif0 4332 | . . . 4 ⊢ (𝑋 ∖ ∅) = 𝑋 | |
8 | 6, 7 | sseqtrrdi 3995 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (𝑋 ∖ ∅)) |
9 | mreexdomd.6 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) | |
10 | 9, 7 | sseqtrrdi 3995 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ (𝑋 ∖ ∅)) |
11 | mreexdomd.5 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ (𝑁‘𝑇)) | |
12 | un0 4350 | . . . . 5 ⊢ (𝑇 ∪ ∅) = 𝑇 | |
13 | 12 | fveq2i 6845 | . . . 4 ⊢ (𝑁‘(𝑇 ∪ ∅)) = (𝑁‘𝑇) |
14 | 11, 13 | sseqtrrdi 3995 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (𝑁‘(𝑇 ∪ ∅))) |
15 | un0 4350 | . . . 4 ⊢ (𝑆 ∪ ∅) = 𝑆 | |
16 | 15, 5 | eqeltrid 2842 | . . 3 ⊢ (𝜑 → (𝑆 ∪ ∅) ∈ 𝐼) |
17 | mreexdomd.7 | . . 3 ⊢ (𝜑 → (𝑆 ∈ Fin ∨ 𝑇 ∈ Fin)) | |
18 | 1, 2, 3, 4, 8, 10, 14, 16, 17 | mreexexd 17527 | . 2 ⊢ (𝜑 → ∃𝑖 ∈ 𝒫 𝑇(𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼)) |
19 | simprrl 779 | . . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑆 ≈ 𝑖) | |
20 | simprl 769 | . . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑖 ∈ 𝒫 𝑇) | |
21 | 20 | elpwid 4569 | . . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑖 ⊆ 𝑇) |
22 | 1 | elfvexd 6881 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ V) |
23 | 22, 9 | ssexd 5281 | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ V) |
24 | ssdomg 8939 | . . . . . 6 ⊢ (𝑇 ∈ V → (𝑖 ⊆ 𝑇 → 𝑖 ≼ 𝑇)) | |
25 | 23, 24 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑖 ⊆ 𝑇 → 𝑖 ≼ 𝑇)) |
26 | 25 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → (𝑖 ⊆ 𝑇 → 𝑖 ≼ 𝑇)) |
27 | 21, 26 | mpd 15 | . . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑖 ≼ 𝑇) |
28 | endomtr 8951 | . . 3 ⊢ ((𝑆 ≈ 𝑖 ∧ 𝑖 ≼ 𝑇) → 𝑆 ≼ 𝑇) | |
29 | 19, 27, 28 | syl2anc 584 | . 2 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝒫 𝑇 ∧ (𝑆 ≈ 𝑖 ∧ (𝑖 ∪ ∅) ∈ 𝐼))) → 𝑆 ≼ 𝑇) |
30 | 18, 29 | rexlimddv 3158 | 1 ⊢ (𝜑 → 𝑆 ≼ 𝑇) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 ∀wral 3064 Vcvv 3445 ∖ cdif 3907 ∪ cun 3908 ⊆ wss 3910 ∅c0 4282 𝒫 cpw 4560 {csn 4586 class class class wbr 5105 ‘cfv 6496 ≈ cen 8879 ≼ cdom 8880 Fincfn 8882 Moorecmre 17461 mrClscmrc 17462 mrIndcmri 17463 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-om 7802 df-1o 8411 df-er 8647 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-card 9874 df-mre 17465 df-mrc 17466 df-mri 17467 |
This theorem is referenced by: mreexfidimd 17529 |
Copyright terms: Public domain | W3C validator |