| 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 17554 | . 2 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))) |
| 6 | 3 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Moore‘𝑋)) |
| 7 | 4 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑆 ⊆ 𝑋) |
| 8 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆) | |
| 9 | 6, 1, 7, 8 | mrieqvlemd 17550 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁‘𝑆))) |
| 10 | 9 | necon3bbid 2967 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| 11 | 10 | ralbidva 3155 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| 12 | 5, 11 | bitrd 279 | 1 ⊢ (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑥 ∈ 𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁‘𝑆))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 ∖ cdif 3896 ⊆ wss 3899 {csn 4578 ‘cfv 6490 Moorecmre 17499 mrClscmrc 17500 mrIndcmri 17501 |
| 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 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| 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 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-fv 6498 df-mre 17503 df-mrc 17504 df-mri 17505 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |