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

Theorem mrissmrcd 17864
Description: In a Moore system, if an independent set is between a set and its closure, the two sets are equal (since the two sets must have equal closures by mressmrcd 17851, and so are equal by mrieqv2d 17863.) (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
mrissmrcd.1 (𝜑 → 𝐴 ∈ (Moore‘𝑋))
mrissmrcd.2 𝑁 = (mrCls‘𝐴)
mrissmrcd.3 𝐼 = (mrInd‘𝐴)
mrissmrcd.4 (𝜑 → 𝑆 ⊆ (𝑁‘𝑇))
mrissmrcd.5 (𝜑 → 𝑇 ⊆ 𝑆)
mrissmrcd.6 (𝜑 → 𝑆 ∈ 𝐼)
Assertion
Ref Expression
mrissmrcd (𝜑 → 𝑆 = 𝑇)

Proof of Theorem mrissmrcd
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 mrissmrcd.1 . . . . . 6 (𝜑 → 𝐴 ∈ (Moore‘𝑋))
2 mrissmrcd.2 . . . . . 6 𝑁 = (mrCls‘𝐴)
3 mrissmrcd.4 . . . . . 6 (𝜑 → 𝑆 ⊆ (𝑁‘𝑇))
4 mrissmrcd.5 . . . . . 6 (𝜑 → 𝑇 ⊆ 𝑆)
51, 2, 3, 4mressmrcd 17851 . . . . 5 (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇))
6 pssne 4029 . . . . . . 7 ((𝑁‘𝑇) ⊊ (𝑁‘𝑆) → (𝑁‘𝑇) ≠ (𝑁‘𝑆))
76necomd 3014 . . . . . 6 ((𝑁‘𝑇) ⊊ (𝑁‘𝑆) → (𝑁‘𝑆) ≠ (𝑁‘𝑇))
87necon2bi 2989 . . . . 5 ((𝑁‘𝑆) = (𝑁‘𝑇) → ¬ (𝑁‘𝑇) ⊊ (𝑁‘𝑆))
95, 8syl 18 . . . 4 (𝜑 → ¬ (𝑁‘𝑇) ⊊ (𝑁‘𝑆))
10 mrissmrcd.6 . . . . . 6 (𝜑 → 𝑆 ∈ 𝐼)
11 mrissmrcd.3 . . . . . . 7 𝐼 = (mrInd‘𝐴)
1211, 1, 10mrissd 17860 . . . . . . 7 (𝜑 → 𝑆 ⊆ 𝑋)
131, 2, 11, 12mrieqv2d 17863 . . . . . 6 (𝜑 → (𝑆 ∈ 𝐼 ↔ ∀𝑠(𝑠 ⊊ 𝑆 → (𝑁‘𝑠) ⊊ (𝑁‘𝑆))))
1410, 13mpbid 235 . . . . 5 (𝜑 → ∀𝑠(𝑠 ⊊ 𝑆 → (𝑁‘𝑠) ⊊ (𝑁‘𝑆)))
1510, 4ssexd 5293 . . . . . 6 (𝜑 → 𝑇 ∈ V)
16 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑠 = 𝑇) → 𝑠 = 𝑇)
1716psseq1d 4025 . . . . . . 7 ((𝜑 ∧ 𝑠 = 𝑇) → (𝑠 ⊊ 𝑆 ↔ 𝑇 ⊊ 𝑆))
1816fveq2d 6920 . . . . . . . 8 ((𝜑 ∧ 𝑠 = 𝑇) → (𝑁‘𝑠) = (𝑁‘𝑇))
1918psseq1d 4025 . . . . . . 7 ((𝜑 ∧ 𝑠 = 𝑇) → ((𝑁‘𝑠) ⊊ (𝑁‘𝑆) ↔ (𝑁‘𝑇) ⊊ (𝑁‘𝑆)))
2017, 19imbi12d 347 . . . . . 6 ((𝜑 ∧ 𝑠 = 𝑇) → ((𝑠 ⊊ 𝑆 → (𝑁‘𝑠) ⊊ (𝑁‘𝑆)) ↔ (𝑇 ⊊ 𝑆 → (𝑁‘𝑇) ⊊ (𝑁‘𝑆))))
2115, 20spcdv 3552 . . . . 5 (𝜑 → (∀𝑠(𝑠 ⊊ 𝑆 → (𝑁‘𝑠) ⊊ (𝑁‘𝑆)) → (𝑇 ⊊ 𝑆 → (𝑁‘𝑇) ⊊ (𝑁‘𝑆))))
2214, 21mpd 16 . . . 4 (𝜑 → (𝑇 ⊊ 𝑆 → (𝑁‘𝑇) ⊊ (𝑁‘𝑆)))
239, 22mtod 201 . . 3 (𝜑 → ¬ 𝑇 ⊊ 𝑆)
24 sspss 4032 . . . . 5 (𝑇 ⊆ 𝑆 ↔ (𝑇 ⊊ 𝑆 ∨ 𝑇 = 𝑆))
254, 24sylib 221 . . . 4 (𝜑 → (𝑇 ⊊ 𝑆 ∨ 𝑇 = 𝑆))
2625ord 878 . . 3 (𝜑 → (¬ 𝑇 ⊊ 𝑆 → 𝑇 = 𝑆))
2723, 26mpd 16 . 2 (𝜑 → 𝑇 = 𝑆)
2827eqcomd 2769 1 (𝜑 → 𝑆 = 𝑇)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ⊊ wpss 4016  ‘cfv 6566  Moorecmre 17802  mrClscmrc 17803  mrIndcmri 17804
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-mre 17806  df-mrc 17807  df-mri 17808
This theorem is used by:  mreexexlem3d  17870  acsmap2d  18779
  Copyright terms: Public domain W3C validator