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

Theorem ismri 17682
Description: Criterion for a set to be an independent set of a Moore system. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
ismri.1 𝑁 = (mrCls‘𝐴)
ismri.2 𝐼 = (mrInd‘𝐴)
Assertion
Ref Expression
ismri (𝐴 ∈ (Moore‘𝑋) → (𝑆𝐼 ↔ (𝑆𝑋 ∧ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑆
Allowed substitution hints:   𝐼(𝑥)   𝑁(𝑥)   𝑋(𝑥)

Proof of Theorem ismri
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 ismri.1 . . . . 5 𝑁 = (mrCls‘𝐴)
2 ismri.2 . . . . 5 𝐼 = (mrInd‘𝐴)
31, 2mrisval 17681 . . . 4 (𝐴 ∈ (Moore‘𝑋) → 𝐼 = {𝑠 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑠 ¬ 𝑥 ∈ (𝑁‘(𝑠 ∖ {𝑥}))})
43eleq2d 2849 . . 3 (𝐴 ∈ (Moore‘𝑋) → (𝑆𝐼𝑆 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑠 ¬ 𝑥 ∈ (𝑁‘(𝑠 ∖ {𝑥}))}))
5 difeq1 4074 . . . . . . . 8 (𝑠 = 𝑆 → (𝑠 ∖ {𝑥}) = (𝑆 ∖ {𝑥}))
65fveq2d 6885 . . . . . . 7 (𝑠 = 𝑆 → (𝑁‘(𝑠 ∖ {𝑥})) = (𝑁‘(𝑆 ∖ {𝑥})))
76eleq2d 2849 . . . . . 6 (𝑠 = 𝑆 → (𝑥 ∈ (𝑁‘(𝑠 ∖ {𝑥})) ↔ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
87notbid 321 . . . . 5 (𝑠 = 𝑆 → (¬ 𝑥 ∈ (𝑁‘(𝑠 ∖ {𝑥})) ↔ ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
98raleqbi1dv 3333 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑠 ¬ 𝑥 ∈ (𝑁‘(𝑠 ∖ {𝑥})) ↔ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
109elrab 3650 . . 3 (𝑆 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∀𝑥𝑠 ¬ 𝑥 ∈ (𝑁‘(𝑠 ∖ {𝑥}))} ↔ (𝑆 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))))
114, 10bitrdi 290 . 2 (𝐴 ∈ (Moore‘𝑋) → (𝑆𝐼 ↔ (𝑆 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))))
12 elfvex 6916 . . . 4 (𝐴 ∈ (Moore‘𝑋) → 𝑋 ∈ V)
13 elpw2g 5304 . . . 4 (𝑋 ∈ V → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
1412, 13syl 18 . . 3 (𝐴 ∈ (Moore‘𝑋) → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
1514anbi1d 642 . 2 (𝐴 ∈ (Moore‘𝑋) → ((𝑆 ∈ 𝒫 𝑋 ∧ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥}))) ↔ (𝑆𝑋 ∧ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))))
1611, 15bitrd 282 1 (𝐴 ∈ (Moore‘𝑋) → (𝑆𝐼 ↔ (𝑆𝑋 ∧ ∀𝑥𝑆 ¬ 𝑥 ∈ (𝑁‘(𝑆 ∖ {𝑥})))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  {crab 3416  Vcvv 3455  cdif 3902  wss 3905  𝒫 cpw 4562  {csn 4589  cfv 6536  Moorecmre 17629  mrClscmrc 17630  mrIndcmri 17631
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fv 6544  df-mre 17633  df-mri 17635
This theorem is referenced by:  ismri2  17683  mriss  17686  lbsacsbs  21280
  Copyright terms: Public domain W3C validator