Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  mrieqvd Structured version   Visualization version   GIF version

Theorem mrieqvd 16972
 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.)
Hypotheses
Ref Expression
mrieqvd.1 (𝜑𝐴 ∈ (Moore‘𝑋))
mrieqvd.2 𝑁 = (mrCls‘𝐴)
mrieqvd.3 𝐼 = (mrInd‘𝐴)
mrieqvd.4 (𝜑𝑆𝑋)
Assertion
Ref Expression
mrieqvd (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑆   𝜑,𝑥
Allowed substitution hints:   𝐼(𝑥)   𝑁(𝑥)   𝑋(𝑥)

Proof of Theorem mrieqvd
StepHypRef Expression
1 mrieqvd.2 . . 3 𝑁 = (mrCls‘𝐴)
2 mrieqvd.3 . . 3 𝐼 = (mrInd‘𝐴)
3 mrieqvd.1 . . 3 (𝜑𝐴 ∈ (Moore‘𝑋))
4 mrieqvd.4 . . 3 (𝜑𝑆𝑋)
51, 2, 3, 4ismri2d 16967 . 2 (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
63adantr 484 . . . . 5 ((𝜑𝑥𝑆) → 𝐴 ∈ (Moore‘𝑋))
74adantr 484 . . . . 5 ((𝜑𝑥𝑆) → 𝑆𝑋)
8 simpr 488 . . . . 5 ((𝜑𝑥𝑆) → 𝑥𝑆)
96, 1, 7, 8mrieqvlemd 16963 . . . 4 ((𝜑𝑥𝑆) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁𝑆)))
109necon3bbid 2988 . . 3 ((𝜑𝑥𝑆) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
1110ralbidva 3125 . 2 (𝜑 → (∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
125, 11bitrd 282 1 (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ≠ wne 2951  ∀wral 3070   ∖ cdif 3857   ⊆ wss 3860  {csn 4525  ‘cfv 6339  Moorecmre 16916  mrClscmrc 16917  mrIndcmri 16918 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5172  ax-nul 5179  ax-pow 5237  ax-pr 5301  ax-un 7464 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-sbc 3699  df-csb 3808  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-nul 4228  df-if 4424  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-int 4842  df-br 5036  df-opab 5098  df-mpt 5116  df-id 5433  df-xp 5533  df-rel 5534  df-cnv 5535  df-co 5536  df-dm 5537  df-rn 5538  df-res 5539  df-ima 5540  df-iota 6298  df-fun 6341  df-fn 6342  df-f 6343  df-fv 6347  df-mre 16920  df-mrc 16921  df-mri 16922 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator