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

Theorem mrieqvd 17595
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 17590 . 2 (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
63adantr 481 . . . . 5 ((𝜑𝑥𝑆) → 𝐴 ∈ (Moore‘𝑋))
74adantr 481 . . . . 5 ((𝜑𝑥𝑆) → 𝑆𝑋)
8 simpr 485 . . . . 5 ((𝜑𝑥𝑆) → 𝑥𝑆)
96, 1, 7, 8mrieqvlemd 17586 . . . 4 ((𝜑𝑥𝑆) → (𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) = (𝑁𝑆)))
109necon3bbid 2971 . . 3 ((𝜑𝑥𝑆) → (¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
1110ralbidva 3160 . 2 (𝜑 → (∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})) ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
125, 11bitrd 280 1 (𝜑 → (𝑆𝐼 ↔ ∀𝑥𝑆 (𝑁‘(𝑆 ∖ {𝑥})) ≠ (𝑁𝑆)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wne 2934  wral 3053  cdif 3880  wss 3883  {csn 4555  cfv 6485  Moorecmre 17535  mrClscmrc 17536  mrIndcmri 17537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-mre 17539  df-mrc 17540  df-mri 17541
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator