| 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 17597 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 7 | 4, 6 | sstrd 3957 | . 2 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
| 8 | 1, 2, 3, 6 | ismri2d 17594 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 9 | 5, 8 | mpbid 232 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 10 | 4 | sseld 3945 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑆)) |
| 11 | 4 | ssdifd 4108 | . . . . . . 7 ⊢ (𝜑 → (𝑇 ∖ {𝑥}) ⊆ (𝑆 ∖ {𝑥})) |
| 12 | 6 | ssdifssd 4110 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∖ {𝑥}) ⊆ 𝑋) |
| 13 | 3, 1, 11, 12 | mrcssd 17585 | . . . . . 6 ⊢ (𝜑 → (𝑁‘(𝑇 ∖ {𝑥})) ⊆ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 14 | 13 | ssneld 3948 | . . . . 5 ⊢ (𝜑 → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 15 | 10, 14 | imim12d 81 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 → ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) → (𝑥 ∈ 𝑇 → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))))) |
| 16 | 15 | ralimdv2 3142 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 17 | 9, 16 | mpd 15 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))) |
| 18 | 1, 2, 3, 7, 17 | ismri2dd 17595 | 1 ⊢ (𝜑 → 𝑇 ∈ 𝐼) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ∖ cdif 3911 ⊆ wss 3914 {csn 4589 ‘cfv 6511 Moorecmre 17543 mrClscmrc 17544 mrIndcmri 17545 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| 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 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-fv 6519 df-mre 17547 df-mrc 17548 df-mri 17549 |
| This theorem is referenced by: mreexexlem2d 17606 acsfiindd 18512 |
| Copyright terms: Public domain | W3C validator |