Theorem mrcuni 17582

Description: Idempotence of closure under a general union. (Contributed by Stefan O'Rear, 31-Jan-2015.)

Hypothesis

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

Assertion

Ref	Expression
mrcuni	⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘∪ 𝑈) = (𝐹‘∪ (𝐹 “ 𝑈)))

Proof of Theorem mrcuni

Dummy variables 𝑥 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 482	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → 𝐶 ∈ (Moore‘𝑋))
2		simpll 766	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑠 ∈ 𝑈) → 𝐶 ∈ (Moore‘𝑋))
3		ssel2 3941	. . . . . . . . 9 ⊢ ((𝑈 ⊆ 𝒫 𝑋 ∧ 𝑠 ∈ 𝑈) → 𝑠 ∈ 𝒫 𝑋)
4	3	elpwid 4572	. . . . . . . 8 ⊢ ((𝑈 ⊆ 𝒫 𝑋 ∧ 𝑠 ∈ 𝑈) → 𝑠 ⊆ 𝑋)
5	4	adantll 714	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑠 ∈ 𝑈) → 𝑠 ⊆ 𝑋)
6		mrcfval.f	. . . . . . . 8 ⊢ 𝐹 = (mrCls‘𝐶)
7	6	mrcssid 17578	. . . . . . 7 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑠 ⊆ 𝑋) → 𝑠 ⊆ (𝐹‘𝑠))
8	2, 5, 7	syl2anc 584	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑠 ∈ 𝑈) → 𝑠 ⊆ (𝐹‘𝑠))
9	6	mrcf 17570	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹:𝒫 𝑋⟶𝐶)
10	9	ffund 6692	. . . . . . . . . 10 ⊢ (𝐶 ∈ (Moore‘𝑋) → Fun 𝐹)
11	10	adantr 480	. . . . . . . . 9 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → Fun 𝐹)
12	9	fdmd 6698	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → dom 𝐹 = 𝒫 𝑋)
13	12	sseq2d 3979	. . . . . . . . . 10 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝑈 ⊆ dom 𝐹 ↔ 𝑈 ⊆ 𝒫 𝑋))
14	13	biimpar 477	. . . . . . . . 9 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → 𝑈 ⊆ dom 𝐹)
15		funfvima2 7205	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑈 ⊆ dom 𝐹) → (𝑠 ∈ 𝑈 → (𝐹‘𝑠) ∈ (𝐹 “ 𝑈)))
16	11, 14, 15	syl2anc 584	. . . . . . . 8 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝑠 ∈ 𝑈 → (𝐹‘𝑠) ∈ (𝐹 “ 𝑈)))
17	16	imp 406	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑠 ∈ 𝑈) → (𝐹‘𝑠) ∈ (𝐹 “ 𝑈))
18		elssuni 4901	. . . . . . 7 ⊢ ((𝐹‘𝑠) ∈ (𝐹 “ 𝑈) → (𝐹‘𝑠) ⊆ ∪ (𝐹 “ 𝑈))
19	17, 18	syl 17	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑠 ∈ 𝑈) → (𝐹‘𝑠) ⊆ ∪ (𝐹 “ 𝑈))
20	8, 19	sstrd 3957	. . . . 5 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑠 ∈ 𝑈) → 𝑠 ⊆ ∪ (𝐹 “ 𝑈))
21	20	ralrimiva 3125	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∀𝑠 ∈ 𝑈 𝑠 ⊆ ∪ (𝐹 “ 𝑈))
22		unissb 4903	. . . 4 ⊢ (∪ 𝑈 ⊆ ∪ (𝐹 “ 𝑈) ↔ ∀𝑠 ∈ 𝑈 𝑠 ⊆ ∪ (𝐹 “ 𝑈))
23	21, 22	sylibr 234	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∪ 𝑈 ⊆ ∪ (𝐹 “ 𝑈))
24	6	mrcssv 17575	. . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹‘𝑥) ⊆ 𝑋)
25	24	adantr 480	. . . . . 6 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘𝑥) ⊆ 𝑋)
26	25	ralrimivw 3129	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∀𝑥 ∈ 𝑈 (𝐹‘𝑥) ⊆ 𝑋)
27	9	ffnd 6689	. . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹 Fn 𝒫 𝑋)
28		sseq1 3972	. . . . . . 7 ⊢ (𝑠 = (𝐹‘𝑥) → (𝑠 ⊆ 𝑋 ↔ (𝐹‘𝑥) ⊆ 𝑋))
29	28	ralima 7211	. . . . . 6 ⊢ ((𝐹 Fn 𝒫 𝑋 ∧ 𝑈 ⊆ 𝒫 𝑋) → (∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ 𝑋 ↔ ∀𝑥 ∈ 𝑈 (𝐹‘𝑥) ⊆ 𝑋))
30	27, 29	sylan 580	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ 𝑋 ↔ ∀𝑥 ∈ 𝑈 (𝐹‘𝑥) ⊆ 𝑋))
31	26, 30	mpbird 257	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ 𝑋)
32		unissb 4903	. . . 4 ⊢ (∪ (𝐹 “ 𝑈) ⊆ 𝑋 ↔ ∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ 𝑋)
33	31, 32	sylibr 234	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∪ (𝐹 “ 𝑈) ⊆ 𝑋)
34	6	mrcss 17577	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∪ 𝑈 ⊆ ∪ (𝐹 “ 𝑈) ∧ ∪ (𝐹 “ 𝑈) ⊆ 𝑋) → (𝐹‘∪ 𝑈) ⊆ (𝐹‘∪ (𝐹 “ 𝑈)))
35	1, 23, 33, 34	syl3anc 1373	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘∪ 𝑈) ⊆ (𝐹‘∪ (𝐹 “ 𝑈)))
36		simpll 766	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑥 ∈ 𝑈) → 𝐶 ∈ (Moore‘𝑋))
37		elssuni 4901	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑈 → 𝑥 ⊆ ∪ 𝑈)
38	37	adantl 481	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑥 ∈ 𝑈) → 𝑥 ⊆ ∪ 𝑈)
39		sspwuni 5064	. . . . . . . . . . 11 ⊢ (𝑈 ⊆ 𝒫 𝑋 ↔ ∪ 𝑈 ⊆ 𝑋)
40	39	biimpi 216	. . . . . . . . . 10 ⊢ (𝑈 ⊆ 𝒫 𝑋 → ∪ 𝑈 ⊆ 𝑋)
41	40	adantl 481	. . . . . . . . 9 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∪ 𝑈 ⊆ 𝑋)
42	41	adantr 480	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑥 ∈ 𝑈) → ∪ 𝑈 ⊆ 𝑋)
43	6	mrcss 17577	. . . . . . . 8 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑥 ⊆ ∪ 𝑈 ∧ ∪ 𝑈 ⊆ 𝑋) → (𝐹‘𝑥) ⊆ (𝐹‘∪ 𝑈))
44	36, 38, 42, 43	syl3anc 1373	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) ∧ 𝑥 ∈ 𝑈) → (𝐹‘𝑥) ⊆ (𝐹‘∪ 𝑈))
45	44	ralrimiva 3125	. . . . . 6 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∀𝑥 ∈ 𝑈 (𝐹‘𝑥) ⊆ (𝐹‘∪ 𝑈))
46		sseq1 3972	. . . . . . . 8 ⊢ (𝑠 = (𝐹‘𝑥) → (𝑠 ⊆ (𝐹‘∪ 𝑈) ↔ (𝐹‘𝑥) ⊆ (𝐹‘∪ 𝑈)))
47	46	ralima 7211	. . . . . . 7 ⊢ ((𝐹 Fn 𝒫 𝑋 ∧ 𝑈 ⊆ 𝒫 𝑋) → (∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ (𝐹‘∪ 𝑈) ↔ ∀𝑥 ∈ 𝑈 (𝐹‘𝑥) ⊆ (𝐹‘∪ 𝑈)))
48	27, 47	sylan 580	. . . . . 6 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ (𝐹‘∪ 𝑈) ↔ ∀𝑥 ∈ 𝑈 (𝐹‘𝑥) ⊆ (𝐹‘∪ 𝑈)))
49	45, 48	mpbird 257	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ (𝐹‘∪ 𝑈))
50		unissb 4903	. . . . 5 ⊢ (∪ (𝐹 “ 𝑈) ⊆ (𝐹‘∪ 𝑈) ↔ ∀𝑠 ∈ (𝐹 “ 𝑈)𝑠 ⊆ (𝐹‘∪ 𝑈))
51	49, 50	sylibr 234	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → ∪ (𝐹 “ 𝑈) ⊆ (𝐹‘∪ 𝑈))
52	6	mrcssv 17575	. . . . 5 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹‘∪ 𝑈) ⊆ 𝑋)
53	52	adantr 480	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘∪ 𝑈) ⊆ 𝑋)
54	6	mrcss 17577	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∪ (𝐹 “ 𝑈) ⊆ (𝐹‘∪ 𝑈) ∧ (𝐹‘∪ 𝑈) ⊆ 𝑋) → (𝐹‘∪ (𝐹 “ 𝑈)) ⊆ (𝐹‘(𝐹‘∪ 𝑈)))
55	1, 51, 53, 54	syl3anc 1373	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘∪ (𝐹 “ 𝑈)) ⊆ (𝐹‘(𝐹‘∪ 𝑈)))
56	6	mrcidm 17580	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∪ 𝑈 ⊆ 𝑋) → (𝐹‘(𝐹‘∪ 𝑈)) = (𝐹‘∪ 𝑈))
57	1, 41, 56	syl2anc 584	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘(𝐹‘∪ 𝑈)) = (𝐹‘∪ 𝑈))
58	55, 57	sseqtrd 3983	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘∪ (𝐹 “ 𝑈)) ⊆ (𝐹‘∪ 𝑈))
59	35, 58	eqssd 3964	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝒫 𝑋) → (𝐹‘∪ 𝑈) = (𝐹‘∪ (𝐹 “ 𝑈)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044   ⊆ wss 3914  𝒫 cpw 4563  ∪ cuni 4871  dom cdm 5638   “ cima 5641  Fun wfun 6505   Fn wfn 6506  ‘cfv 6511  Moorecmre 17543  mrClscmrc 17544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-mre 17547  df-mrc 17548

This theorem is referenced by:  mrcun  17583  isacs4lem  18503