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

Theorem mrieqvd 17670
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 17665 . 2 (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
63adantr 484 . . . . 5 ((𝜑𝑥𝑆) → 𝐴 ∈ (Moore‘𝑋))
74adantr 484 . . . . 5 ((𝜑𝑥𝑆) → 𝑆𝑋)
8 simpr 488 . . . . 5 ((𝜑𝑥𝑆) → 𝑥𝑆)
96, 1, 7, 8mrieqvlemd 17661 . . . 4 ((𝜑𝑥𝑆) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁𝑆)))
109necon3bbid 2994 . . 3 ((𝜑𝑥𝑆) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
1110ralbidva 3183 . 2 (𝜑 → (∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
125, 11bitrd 281 1 (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399   = wceq 1560  wcel 2142  wne 2957  wral 3076  cdif 3901  wss 3904  {csn 4582  cfv 6521  Moorecmre 17610  mrClscmrc 17611  mrIndcmri 17612
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-fv 6529  df-mre 17614  df-mrc 17615  df-mri 17616
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator