Theorem isacs4lem 18272

Description: In a closure system in which directed unions of closed sets are closed, closure commutes with directed unions. (Contributed by Stefan O'Rear, 2-Apr-2015.)

Hypothesis

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

Assertion

Ref	Expression
isacs4lem	⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → (𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))

Distinct variable groups:   𝐶,𝑠,𝑡   𝐹,𝑠,𝑡   𝑋,𝑠,𝑡

Proof of Theorem isacs4lem

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

Step	Hyp	Ref	Expression
1		simpll 764	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝐶 ∈ (Moore‘𝑋))
2		elpwi 4542	. . . . . . . 8 ⊢ (𝑡 ∈ 𝒫 𝒫 𝑋 → 𝑡 ⊆ 𝒫 𝑋)
3	2	ad2antrl 725	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝑡 ⊆ 𝒫 𝑋)
4		acsdrscl.f	. . . . . . . 8 ⊢ 𝐹 = (mrCls‘𝐶)
5	4	mrcuni 17340	. . . . . . 7 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑡 ⊆ 𝒫 𝑋) → (𝐹‘∪ 𝑡) = (𝐹‘∪ (𝐹 “ 𝑡)))
6	1, 3, 5	syl2anc 584	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹‘∪ 𝑡) = (𝐹‘∪ (𝐹 “ 𝑡)))
7	4	mrcf 17328	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹:𝒫 𝑋⟶𝐶)
8	7	ffnd 6593	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹 Fn 𝒫 𝑋)
9	8	adantr 481	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝐹 Fn 𝒫 𝑋)
10		simpll 764	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → 𝐶 ∈ (Moore‘𝑋))
11		simprl 768	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → 𝑥 ⊆ 𝑦)
12		simprr 770	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → 𝑦 ⊆ 𝑋)
13	10, 4, 11, 12	mrcssd 17343	. . . . . . . . . 10 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → (𝐹‘𝑥) ⊆ (𝐹‘𝑦))
14		simprr 770	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (toInc‘𝑡) ∈ Dirset)
15	2	ad2antrl 725	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝑡 ⊆ 𝒫 𝑋)
16	4	fvexi 6780	. . . . . . . . . . . 12 ⊢ 𝐹 ∈ V
17	16	imaex 7753	. . . . . . . . . . 11 ⊢ (𝐹 “ 𝑡) ∈ V
18	17	a1i 11	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹 “ 𝑡) ∈ V)
19	9, 13, 14, 15, 18	ipodrsima 18269	. . . . . . . . 9 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (toInc‘(𝐹 “ 𝑡)) ∈ Dirset)
20	19	adantlr 712	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (toInc‘(𝐹 “ 𝑡)) ∈ Dirset)
21		fveq2 6766	. . . . . . . . . . 11 ⊢ (𝑠 = (𝐹 “ 𝑡) → (toInc‘𝑠) = (toInc‘(𝐹 “ 𝑡)))
22	21	eleq1d 2823	. . . . . . . . . 10 ⊢ (𝑠 = (𝐹 “ 𝑡) → ((toInc‘𝑠) ∈ Dirset ↔ (toInc‘(𝐹 “ 𝑡)) ∈ Dirset))
23		unieq 4850	. . . . . . . . . . 11 ⊢ (𝑠 = (𝐹 “ 𝑡) → ∪ 𝑠 = ∪ (𝐹 “ 𝑡))
24	23	eleq1d 2823	. . . . . . . . . 10 ⊢ (𝑠 = (𝐹 “ 𝑡) → (∪ 𝑠 ∈ 𝐶 ↔ ∪ (𝐹 “ 𝑡) ∈ 𝐶))
25	22, 24	imbi12d 345	. . . . . . . . 9 ⊢ (𝑠 = (𝐹 “ 𝑡) → (((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶) ↔ ((toInc‘(𝐹 “ 𝑡)) ∈ Dirset → ∪ (𝐹 “ 𝑡) ∈ 𝐶)))
26		simplr 766	. . . . . . . . 9 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶))
27		imassrn 5973	. . . . . . . . . . . 12 ⊢ (𝐹 “ 𝑡) ⊆ ran 𝐹
28	7	frnd 6600	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (Moore‘𝑋) → ran 𝐹 ⊆ 𝐶)
29	27, 28	sstrid 3931	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹 “ 𝑡) ⊆ 𝐶)
30	17	elpw 4537	. . . . . . . . . . 11 ⊢ ((𝐹 “ 𝑡) ∈ 𝒫 𝐶 ↔ (𝐹 “ 𝑡) ⊆ 𝐶)
31	29, 30	sylibr 233	. . . . . . . . . 10 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹 “ 𝑡) ∈ 𝒫 𝐶)
32	31	ad2antrr 723	. . . . . . . . 9 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹 “ 𝑡) ∈ 𝒫 𝐶)
33	25, 26, 32	rspcdva 3561	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → ((toInc‘(𝐹 “ 𝑡)) ∈ Dirset → ∪ (𝐹 “ 𝑡) ∈ 𝐶))
34	20, 33	mpd 15	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → ∪ (𝐹 “ 𝑡) ∈ 𝐶)
35	4	mrcid 17332	. . . . . . 7 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∪ (𝐹 “ 𝑡) ∈ 𝐶) → (𝐹‘∪ (𝐹 “ 𝑡)) = ∪ (𝐹 “ 𝑡))
36	1, 34, 35	syl2anc 584	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹‘∪ (𝐹 “ 𝑡)) = ∪ (𝐹 “ 𝑡))
37	6, 36	eqtrd 2778	. . . . 5 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))
38	37	exp32 421	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → (𝑡 ∈ 𝒫 𝒫 𝑋 → ((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))
39	38	ralrimiv 3107	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡)))
40	39	ex 413	. 2 ⊢ (𝐶 ∈ (Moore‘𝑋) → (∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶) → ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))
41	40	imdistani 569	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → (𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064  Vcvv 3429   ⊆ wss 3886  𝒫 cpw 4533  ∪ cuni 4839  ran crn 5585   “ cima 5587   Fn wfn 6421  ‘cfv 6426  Moorecmre 17301  mrClscmrc 17302  Dirsetcdrs 18022  toInccipo 18255

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5221  ax-nul 5228  ax-pow 5286  ax-pr 5350  ax-un 7578  ax-cnex 10937  ax-resscn 10938  ax-1cn 10939  ax-icn 10940  ax-addcl 10941  ax-addrcl 10942  ax-mulcl 10943  ax-mulrcl 10944  ax-mulcom 10945  ax-addass 10946  ax-mulass 10947  ax-distr 10948  ax-i2m1 10949  ax-1ne0 10950  ax-1rid 10951  ax-rnegex 10952  ax-rrecex 10953  ax-cnre 10954  ax-pre-lttri 10955  ax-pre-lttrn 10956  ax-pre-ltadd 10957  ax-pre-mulgt0 10958

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3071  df-rab 3073  df-v 3431  df-sbc 3716  df-csb 3832  df-dif 3889  df-un 3891  df-in 3893  df-ss 3903  df-pss 3905  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5074  df-opab 5136  df-mpt 5157  df-tr 5191  df-id 5484  df-eprel 5490  df-po 5498  df-so 5499  df-fr 5539  df-we 5541  df-xp 5590  df-rel 5591  df-cnv 5592  df-co 5593  df-dm 5594  df-rn 5595  df-res 5596  df-ima 5597  df-pred 6195  df-ord 6262  df-on 6263  df-lim 6264  df-suc 6265  df-iota 6384  df-fun 6428  df-fn 6429  df-f 6430  df-f1 6431  df-fo 6432  df-f1o 6433  df-fv 6434  df-riota 7224  df-ov 7270  df-oprab 7271  df-mpo 7272  df-om 7703  df-1st 7820  df-2nd 7821  df-frecs 8084  df-wrecs 8115  df-recs 8189  df-rdg 8228  df-1o 8284  df-er 8485  df-en 8721  df-dom 8722  df-sdom 8723  df-fin 8724  df-pnf 11021  df-mnf 11022  df-xr 11023  df-ltxr 11024  df-le 11025  df-sub 11217  df-neg 11218  df-nn 11984  df-2 12046  df-3 12047  df-4 12048  df-5 12049  df-6 12050  df-7 12051  df-8 12052  df-9 12053  df-n0 12244  df-z 12330  df-dec 12448  df-uz 12593  df-fz 13250  df-struct 16858  df-slot 16893  df-ndx 16905  df-base 16923  df-tset 16991  df-ple 16992  df-ocomp 16993  df-mre 17305  df-mrc 17306  df-proset 18023  df-drs 18024  df-poset 18041  df-ipo 18256

This theorem is referenced by:  acsdrscl  18274  acsficl  18275  isacs5  18276  isacs4  18277  isacs3  18278