| 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 17559 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 7 | 4, 6 | sstrd 3944 | . 2 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
| 8 | 1, 2, 3, 6 | ismri2d 17556 | . . . 4 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 9 | 5, 8 | mpbid 232 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 10 | 4 | sseld 3932 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑆)) |
| 11 | 4 | ssdifd 4097 | . . . . . . 7 ⊢ (𝜑 → (𝑇 ∖ {𝑥}) ⊆ (𝑆 ∖ {𝑥})) |
| 12 | 6 | ssdifssd 4099 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∖ {𝑥}) ⊆ 𝑋) |
| 13 | 3, 1, 11, 12 | mrcssd 17547 | . . . . . 6 ⊢ (𝜑 → (𝑁‘(𝑇 ∖ {𝑥})) ⊆ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 14 | 13 | ssneld 3935 | . . . . 5 ⊢ (𝜑 → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 15 | 10, 14 | imim12d 81 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 → ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) → (𝑥 ∈ 𝑇 → ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))))) |
| 16 | 15 | ralimdv2 3145 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥})))) |
| 17 | 9, 16 | mpd 15 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑇 ¬ 𝑥 ∈ (𝑁‘(𝑇 ∖ {𝑥}))) |
| 18 | 1, 2, 3, 7, 17 | ismri2dd 17557 | 1 ⊢ (𝜑 → 𝑇 ∈ 𝐼) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∖ cdif 3898 ⊆ wss 3901 {csn 4580 ‘cfv 6492 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-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-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 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-id 5519 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-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-mre 17505 df-mrc 17506 df-mri 17507 |
| This theorem is referenced by: mreexexlem2d 17568 acsfiindd 18476 |
| Copyright terms: Public domain | W3C validator |