Theorem mrcssv 17672

Description: The closure of a set is a subset of the base. (Contributed by Stefan O'Rear, 31-Jan-2015.)

Hypothesis

Ref	Expression
mrcfval.f	⊢ 𝐹 = (mrCls‘𝐶)

Assertion

Ref	Expression
mrcssv	⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹‘𝑈) ⊆ 𝑋)

Proof of Theorem mrcssv

Step	Hyp	Ref	Expression
1		fvssunirn 6953	. 2 ⊢ (𝐹‘𝑈) ⊆ ∪ ran 𝐹
2		mrcfval.f	. . . . 5 ⊢ 𝐹 = (mrCls‘𝐶)
3	2	mrcf 17667	. . . 4 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹:𝒫 𝑋⟶𝐶)
4		frn 6754	. . . 4 ⊢ (𝐹:𝒫 𝑋⟶𝐶 → ran 𝐹 ⊆ 𝐶)
5		uniss 4939	. . . 4 ⊢ (ran 𝐹 ⊆ 𝐶 → ∪ ran 𝐹 ⊆ ∪ 𝐶)
6	3, 4, 5	3syl 18	. . 3 ⊢ (𝐶 ∈ (Moore‘𝑋) → ∪ ran 𝐹 ⊆ ∪ 𝐶)
7		mreuni 17658	. . 3 ⊢ (𝐶 ∈ (Moore‘𝑋) → ∪ 𝐶 = 𝑋)
8	6, 7	sseqtrd 4049	. 2 ⊢ (𝐶 ∈ (Moore‘𝑋) → ∪ ran 𝐹 ⊆ 𝑋)
9	1, 8	sstrid 4020	1 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹‘𝑈) ⊆ 𝑋)

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108   ⊆ wss 3976  𝒫 cpw 4622  ∪ cuni 4931  ran crn 5701  ⟶wf 6569  ‘cfv 6573  Moorecmre 17640  mrClscmrc 17641

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-mre 17644  df-mrc 17645

This theorem is referenced by:  mrcidb  17673  mrcuni  17679  mrcssvd  17681  mrefg2  42663  proot1hash  43156