Theorem isacs4lem 18452

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 766	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝐶 ∈ (Moore‘𝑋))
2		elpwi 4556	. . . . . . . 8 ⊢ (𝑡 ∈ 𝒫 𝒫 𝑋 → 𝑡 ⊆ 𝒫 𝑋)
3	2	ad2antrl 728	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝑡 ⊆ 𝒫 𝑋)
4		acsdrscl.f	. . . . . . . 8 ⊢ 𝐹 = (mrCls‘𝐶)
5	4	mrcuni 17529	. . . . . . 7 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑡 ⊆ 𝒫 𝑋) → (𝐹‘∪ 𝑡) = (𝐹‘∪ (𝐹 “ 𝑡)))
6	1, 3, 5	syl2anc 584	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹‘∪ 𝑡) = (𝐹‘∪ (𝐹 “ 𝑡)))
7	4	mrcf 17517	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹:𝒫 𝑋⟶𝐶)
8	7	ffnd 6657	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐹 Fn 𝒫 𝑋)
9	8	adantr 480	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝐹 Fn 𝒫 𝑋)
10		simpll 766	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → 𝐶 ∈ (Moore‘𝑋))
11		simprl 770	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → 𝑥 ⊆ 𝑦)
12		simprr 772	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → 𝑦 ⊆ 𝑋)
13	10, 4, 11, 12	mrcssd 17532	. . . . . . . . . 10 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) ∧ (𝑥 ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑋)) → (𝐹‘𝑥) ⊆ (𝐹‘𝑦))
14		simprr 772	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (toInc‘𝑡) ∈ Dirset)
15	2	ad2antrl 728	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → 𝑡 ⊆ 𝒫 𝑋)
16	4	fvexi 6842	. . . . . . . . . . . 12 ⊢ 𝐹 ∈ V
17	16	imaex 7850	. . . . . . . . . . 11 ⊢ (𝐹 “ 𝑡) ∈ V
18	17	a1i 11	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹 “ 𝑡) ∈ V)
19	9, 13, 14, 15, 18	ipodrsima 18449	. . . . . . . . 9 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (toInc‘(𝐹 “ 𝑡)) ∈ Dirset)
20	19	adantlr 715	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (toInc‘(𝐹 “ 𝑡)) ∈ Dirset)
21		fveq2 6828	. . . . . . . . . . 11 ⊢ (𝑠 = (𝐹 “ 𝑡) → (toInc‘𝑠) = (toInc‘(𝐹 “ 𝑡)))
22	21	eleq1d 2818	. . . . . . . . . 10 ⊢ (𝑠 = (𝐹 “ 𝑡) → ((toInc‘𝑠) ∈ Dirset ↔ (toInc‘(𝐹 “ 𝑡)) ∈ Dirset))
23		unieq 4869	. . . . . . . . . . 11 ⊢ (𝑠 = (𝐹 “ 𝑡) → ∪ 𝑠 = ∪ (𝐹 “ 𝑡))
24	23	eleq1d 2818	. . . . . . . . . 10 ⊢ (𝑠 = (𝐹 “ 𝑡) → (∪ 𝑠 ∈ 𝐶 ↔ ∪ (𝐹 “ 𝑡) ∈ 𝐶))
25	22, 24	imbi12d 344	. . . . . . . . 9 ⊢ (𝑠 = (𝐹 “ 𝑡) → (((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶) ↔ ((toInc‘(𝐹 “ 𝑡)) ∈ Dirset → ∪ (𝐹 “ 𝑡) ∈ 𝐶)))
26		simplr 768	. . . . . . . . 9 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶))
27		imassrn 6024	. . . . . . . . . . . 12 ⊢ (𝐹 “ 𝑡) ⊆ ran 𝐹
28	7	frnd 6664	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (Moore‘𝑋) → ran 𝐹 ⊆ 𝐶)
29	27, 28	sstrid 3942	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹 “ 𝑡) ⊆ 𝐶)
30	17	elpw 4553	. . . . . . . . . . 11 ⊢ ((𝐹 “ 𝑡) ∈ 𝒫 𝐶 ↔ (𝐹 “ 𝑡) ⊆ 𝐶)
31	29, 30	sylibr 234	. . . . . . . . . 10 ⊢ (𝐶 ∈ (Moore‘𝑋) → (𝐹 “ 𝑡) ∈ 𝒫 𝐶)
32	31	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹 “ 𝑡) ∈ 𝒫 𝐶)
33	25, 26, 32	rspcdva 3574	. . . . . . . 8 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → ((toInc‘(𝐹 “ 𝑡)) ∈ Dirset → ∪ (𝐹 “ 𝑡) ∈ 𝐶))
34	20, 33	mpd 15	. . . . . . 7 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → ∪ (𝐹 “ 𝑡) ∈ 𝐶)
35	4	mrcid 17521	. . . . . . 7 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∪ (𝐹 “ 𝑡) ∈ 𝐶) → (𝐹‘∪ (𝐹 “ 𝑡)) = ∪ (𝐹 “ 𝑡))
36	1, 34, 35	syl2anc 584	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹‘∪ (𝐹 “ 𝑡)) = ∪ (𝐹 “ 𝑡))
37	6, 36	eqtrd 2768	. . . . 5 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) ∧ (𝑡 ∈ 𝒫 𝒫 𝑋 ∧ (toInc‘𝑡) ∈ Dirset)) → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))
38	37	exp32 420	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → (𝑡 ∈ 𝒫 𝒫 𝑋 → ((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))
39	38	ralrimiv 3124	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡)))
40	39	ex 412	. 2 ⊢ (𝐶 ∈ (Moore‘𝑋) → (∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶) → ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))
41	40	imdistani 568	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)) → (𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑡 ∈ 𝒫 𝒫 𝑋((toInc‘𝑡) ∈ Dirset → (𝐹‘∪ 𝑡) = ∪ (𝐹 “ 𝑡))))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3048  Vcvv 3437   ⊆ wss 3898  𝒫 cpw 4549  ∪ cuni 4858  ran crn 5620   “ cima 5622   Fn wfn 6481  ‘cfv 6486  Moorecmre 17486  mrClscmrc 17487  Dirsetcdrs 18201  toInccipo 18435

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-2 12195  df-3 12196  df-4 12197  df-5 12198  df-6 12199  df-7 12200  df-8 12201  df-9 12202  df-n0 12389  df-z 12476  df-dec 12595  df-uz 12739  df-fz 13410  df-struct 17060  df-slot 17095  df-ndx 17107  df-base 17123  df-tset 17182  df-ple 17183  df-ocomp 17184  df-mre 17490  df-mrc 17491  df-proset 18202  df-drs 18203  df-poset 18221  df-ipo 18436

This theorem is referenced by:  acsdrscl  18454  acsficl  18455  isacs5  18456  isacs4  18457  isacs3  18458