| 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 17698 | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| 6 | 2, 3, 4, 5 | ismri2d 17695 | . . 3 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 7 | 1, 6 | mpbid 235 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) |
| 8 | ismri2dad.5 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑆) | |
| 9 | simpr 489 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → 𝑥 = 𝑌) | |
| 10 | 9 | sneqd 4600 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → {𝑥} = {𝑌}) |
| 11 | 10 | difeq2d 4080 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑆 ∖ {𝑥}) = (𝑆 ∖ {𝑌})) |
| 12 | 11 | fveq2d 6885 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁‘(𝑆 ∖ {𝑌}))) |
| 13 | 9, 12 | eleq12d 2856 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌})))) |
| 14 | 13 | notbid 321 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑌) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌})))) |
| 15 | 8, 14 | rspcdv 3572 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) → ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌})))) |
| 16 | 7, 15 | mpd 16 | 1 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘(𝑆 ∖ {𝑌}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∀wral 3078 ∖ cdif 3901 {csn 4588 ‘cfv 6536 Moorecmre 17640 mrClscmrc 17641 mrIndcmri 17642 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-iota 6492 df-fun 6538 df-fv 6544 df-mre 17644 df-mri 17646 |
| This theorem is used by: mrieqv2d 17701 mreexmrid 17705 mreexexlem2d 17707 acsfiindd 18615 |
| Copyright terms: Public domain | W3C validator |