| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mrissmrid | Structured version Visualization version GIF version | ||
| Description: In a Moore system, subsets of independent sets are independent. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| mrissmrid.1 | ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) |
| mrissmrid.2 | ⊢ 𝑁 = (mrCls‘𝐴) |
| mrissmrid.3 | ⊢ 𝐼 = (mrInd‘𝐴) |
| mrissmrid.4 | ⊢ (𝜑 → 𝑆 ∈ 𝐼) |
| mrissmrid.5 | ⊢ (𝜑 → 𝑇 ⊆ 𝑆) |
| Ref | Expression |
|---|---|
| mrissmrid | ⊢ (𝜑 → 𝑇 ∈ 𝐼) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mrissmrid.2 | . 2 ⊢ 𝑁 = (mrCls‘𝐴) | |
| 2 | mrissmrid.3 | . 2 ⊢ 𝐼 = (mrInd‘𝐴) | |
| 3 | mrissmrid.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) | |
| 4 | mrissmrid.5 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ 𝑆) | |
| 5 | mrissmrid.4 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝐼) | |
| 6 | 2, 3, 5 | mrissd 17727 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 7 | 4, 6 | sstrd 3941 | . 2 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
| 8 | 1, 2, 3, 6 | ismri2d 17724 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 9 | 5, 8 | mpbid 235 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 10 | 4 | sseld 3930 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑆)) |
| 11 | 4 | ssdifd 4092 | . . . . . . 7 ⊢ (𝜑 → (𝑇 ∖ {𝑥}) ⊆ (𝑆 ∖ {𝑥})) |
| 12 | 6 | ssdifssd 4094 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∖ {𝑥}) ⊆ 𝑋) |
| 13 | 3, 1, 11, 12 | mrcssd 17715 | . . . . . 6 ⊢ (𝜑 → (𝑁‘(𝑇 ∖ {𝑥})) ⊆ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 14 | 13 | ssneld 3933 | . . . . 5 ⊢ (𝜑 → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 15 | 10, 14 | imim12d 82 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 → ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) → (𝑥 ∈ 𝑇 → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))))) |
| 16 | 15 | ralimdv2 3171 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 17 | 9, 16 | mpd 16 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))) |
| 18 | 1, 2, 3, 7, 17 | ismri2dd 17725 | 1 ⊢ (𝜑 → 𝑇 ∈ 𝐼) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∖ cdif 3896 ⊆ wss 3899 {csn 4584 ‘cfv 6533 Moorecmre 17669 mrClscmrc 17670 mrIndcmri 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 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-mre 17673 df-mrc 17674 df-mri 17675 |
| This theorem is used by: mreexexlem2d 17736 acsfiindd 18644 |
| Copyright terms: Public domain | W3C validator |