| 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 17668 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 7 | 4, 6 | sstrd 3946 | . 2 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
| 8 | 1, 2, 3, 6 | ismri2d 17665 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 9 | 5, 8 | mpbid 234 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 10 | 4 | sseld 3935 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑆)) |
| 11 | 4 | ssdifd 4098 | . . . . . . 7 ⊢ (𝜑 → (𝑇 ∖ {𝑥}) ⊆ (𝑆 ∖ {𝑥})) |
| 12 | 6 | ssdifssd 4100 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∖ {𝑥}) ⊆ 𝑋) |
| 13 | 3, 1, 11, 12 | mrcssd 17656 | . . . . . 6 ⊢ (𝜑 → (𝑁‘(𝑇 ∖ {𝑥})) ⊆ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 14 | 13 | ssneld 3938 | . . . . 5 ⊢ (𝜑 → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 15 | 10, 14 | imim12d 81 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 → ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) → (𝑥 ∈ 𝑇 → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))))) |
| 16 | 15 | ralimdv2 3171 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 17 | 9, 16 | mpd 15 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))) |
| 18 | 1, 2, 3, 7, 17 | ismri2dd 17666 | 1 ⊢ (𝜑 → 𝑇 ∈ 𝐼) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1560 ∈ wcel 2142 ∀wral 3076 ∖ cdif 3901 ⊆ wss 3904 {csn 4582 ‘cfv 6521 Moorecmre 17610 mrClscmrc 17611 mrIndcmri 17612 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-fv 6529 df-mre 17614 df-mrc 17615 df-mri 17616 |
| This theorem is referenced by: mreexexlem2d 17677 acsfiindd 18585 |
| Copyright terms: Public domain | W3C validator |