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

Theorem mrcss 17831
Description: Closure preserves subset ordering. (Contributed by Stefan O'Rear, 31-Jan-2015.)
Hypothesis
Ref Expression
mrcfval.f 𝐹 = (mrCls‘𝐶)
Assertion
Ref Expression
mrcss ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘𝑈) ⊆ (𝐹‘𝑉))

Proof of Theorem mrcss
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 sstr2 3920 . . . . . 6 (𝑈 ⊆ 𝑉 → (𝑉 ⊆ 𝑠 → 𝑈 ⊆ 𝑠))
21adantr 486 . . . . 5 ((𝑈 ⊆ 𝑉 ∧ 𝑠 ∈ 𝐶) → (𝑉 ⊆ 𝑠 → 𝑈 ⊆ 𝑠))
32ss2rabdv 4003 . . . 4 (𝑈 ⊆ 𝑉 → {𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠} ⊆ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠})
4 intss 4932 . . . 4 ({𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠} ⊆ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} → ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ⊆ ∩ {𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠})
53, 4syl 18 . . 3 (𝑈 ⊆ 𝑉 → ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ⊆ ∩ {𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠})
653ad2ant2 1152 . 2 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠} ⊆ ∩ {𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠})
7 simp1 1154 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → 𝐶 ∈ (Moore‘𝑋))
8 sstr 3921 . . . 4 ((𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → 𝑈 ⊆ 𝑋)
983adant1 1148 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → 𝑈 ⊆ 𝑋)
10 mrcfval.f . . . 4 𝐹 = (mrCls‘𝐶)
1110mrcval 17825 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑋) → (𝐹‘𝑈) = ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠})
127, 9, 11syl2anc 596 . 2 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘𝑈) = ∩ {𝑠 ∈ 𝐶 ∣ 𝑈 ⊆ 𝑠})
1310mrcval 17825 . . 3 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑉 ⊆ 𝑋) → (𝐹‘𝑉) = ∩ {𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠})
14133adant2 1149 . 2 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘𝑉) = ∩ {𝑠 ∈ 𝐶 ∣ 𝑉 ⊆ 𝑠})
156, 12, 143sstr4d 3968 1 ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝑉 ∧ 𝑉 ⊆ 𝑋) → (𝐹‘𝑈) ⊆ (𝐹‘𝑉))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  ∩ cint 4910  ‘cfv 6564  Moorecmre 17793  mrClscmrc 17794
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 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781
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-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 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-fv 6572  df-mre 17797  df-mrc 17798
This theorem is used by:  mrcsscl  17835  mrcuni  17836  mrcssd  17839  ismrc  43972  isnacs3  43981
  Copyright terms: Public domain W3C validator