| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mrieqvd | Structured version Visualization version GIF version | ||
| Description: In a Moore system, a set is independent if and only if, for all elements of the set, the closure of the set with the element removed is unequal to the closure of the original set. Part of Proposition 4.1.3 in [FaureFrolicher] p. 83. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| mrieqvd.1 | ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) |
| mrieqvd.2 | ⊢ 𝑁 = (mrCls‘𝐴) |
| mrieqvd.3 | ⊢ 𝐼 = (mrInd‘𝐴) |
| mrieqvd.4 | ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
| Ref | Expression |
|---|---|
| mrieqvd | ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mrieqvd.2 | . . 3 ⊢ 𝑁 = (mrCls‘𝐴) | |
| 2 | mrieqvd.3 | . . 3 ⊢ 𝐼 = (mrInd‘𝐴) | |
| 3 | mrieqvd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) | |
| 4 | mrieqvd.4 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) | |
| 5 | 1, 2, 3, 4 | ismri2d 17689 | . 2 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 6 | 3 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Moore‘𝑋)) |
| 7 | 4 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ 𝑋) |
| 8 | simpr 489 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆) | |
| 9 | 6, 1, 7, 8 | mrieqvlemd 17685 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁‘𝑆))) |
| 10 | 9 | necon3bbid 3001 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| 11 | 10 | ralbidva 3192 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| 12 | 5, 11 | bitrd 282 | 1 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ∖ cdif 3910 ⊆ wss 3913 {csn 4594 ‘cfv 6537 Moorecmre 17634 mrClscmrc 17635 mrIndcmri 17636 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-mre 17638 df-mrc 17639 df-mri 17640 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |