| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ismri2dad | Structured version Visualization version GIF version | ||
| Description: Consequence of a set in a Moore system being independent. Deduction form. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| ismri2dad.1 | ⊢ 𝑁 = (mrCls‘𝐴) |
| ismri2dad.2 | ⊢ 𝐼 = (mrInd‘𝐴) |
| ismri2dad.3 | ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) |
| ismri2dad.4 | ⊢ (𝜑 → 𝑆 ∈ 𝐼) |
| ismri2dad.5 | ⊢ (𝜑 → 𝑌 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| ismri2dad | ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ismri2dad.4 | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝐼) | |
| 2 | ismri2dad.1 | . . . 4 ⊢ 𝑁 = (mrCls‘𝐴) | |
| 3 | ismri2dad.2 | . . . 4 ⊢ 𝐼 = (mrInd‘𝐴) | |
| 4 | ismri2dad.3 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) | |
| 5 | 3, 4, 1 | mrissd 17728 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 6 | 2, 3, 4, 5 | ismri2d 17725 | . . 3 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 7 | 1, 6 | mpbid 235 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 8 | ismri2dad.5 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑆) | |
| 9 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝑥 = 𝑌) | |
| 10 | 9 | sneqd 4599 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → {𝑥} = {𝑌}) |
| 11 | 10 | difeq2d 4077 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑆 ∖ {𝑥}) = (𝑆 ∖ {𝑌})) |
| 12 | 11 | fveq2d 6886 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁‘(𝑆 ∖ {𝑌}))) |
| 13 | 9, 12 | eleq12d 2856 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌})))) |
| 14 | 13 | notbid 321 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌})))) |
| 15 | 8, 14 | rspcdv 3571 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌})))) |
| 16 | 7, 15 | mpd 16 | 1 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 ∖ cdif 3899 {csn 4587 ‘cfv 6537 Moorecmre 17670 mrClscmrc 17671 mrIndcmri 17672 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-iota 6493 df-fun 6539 df-fv 6545 df-mre 17674 df-mri 17676 |
| This theorem is used by: mrieqv2d 17731 mreexmrid 17735 mreexexlem2d 17737 acsfiindd 18645 |
| Copyright terms: Public domain | W3C validator |