| 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 17599 | . 2 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 6 | 3 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Moore‘𝑋)) |
| 7 | 4 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ 𝑋) |
| 8 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆) | |
| 9 | 6, 1, 7, 8 | mrieqvlemd 17595 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁‘𝑆))) |
| 10 | 9 | necon3bbid 2969 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| 11 | 10 | ralbidva 3158 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| 12 | 5, 11 | bitrd 279 | 1 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 ∖ cdif 3886 ⊆ wss 3889 {csn 4567 ‘cfv 6498 Moorecmre 17544 mrClscmrc 17545 mrIndcmri 17546 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-mre 17548 df-mrc 17549 df-mri 17550 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |