isacs3lem - Metamath Proof Explorer

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

Theorem isacs3lem 18491

Description: An algebraic closure system satisfies isacs3 18499. (Contributed by Stefan O'Rear, 2-Apr-2015.)

**Assertion**
Ref	Expression
isacs3lem	⊢ (𝐶 ∈ (ACS‘𝑋) → (𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)))

Distinct variable groups: 𝐶,𝑠 𝑋,𝑠

Proof of Theorem isacs3lem Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		acsmre 17592	. 2 ⊢ (𝐶 ∈ (ACS‘𝑋) → 𝐶 ∈ (Moore‘𝑋))
2		mresspw 17532	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐶 ⊆ 𝒫 𝑋)
3	1, 2	syl 17	. . . . . . . . . 10 ⊢ (𝐶 ∈ (ACS‘𝑋) → 𝐶 ⊆ 𝒫 𝑋)
4	3	sspwd 4614	. . . . . . . . 9 ⊢ (𝐶 ∈ (ACS‘𝑋) → 𝒫 𝐶 ⊆ 𝒫 𝒫 𝑋)
5	4	sselda 3981	. . . . . . . 8 ⊢ ((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) → 𝑠 ∈ 𝒫 𝒫 𝑋)
6	5	elpwid 4610	. . . . . . 7 ⊢ ((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) → 𝑠 ⊆ 𝒫 𝑋)
7		sspwuni 5102	. . . . . . 7 ⊢ (𝑠 ⊆ 𝒫 𝑋 ↔ ∪ 𝑠 ⊆ 𝑋)
8	6, 7	sylib 217	. . . . . 6 ⊢ ((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) → ∪ 𝑠 ⊆ 𝑋)
9	8	adantr 481	. . . . 5 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) → ∪ 𝑠 ⊆ 𝑋)
10		elinel1 4194	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin) → 𝑥 ∈ 𝒫 ∪ 𝑠)
11	10	elpwid 4610	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin) → 𝑥 ⊆ ∪ 𝑠)
12		elinel2 4195	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin) → 𝑥 ∈ Fin)
13		fissuni 9353	. . . . . . . . . 10 ⊢ ((𝑥 ⊆ ∪ 𝑠 ∧ 𝑥 ∈ Fin) → ∃𝑦 ∈ (𝒫 𝑠 ∩ Fin)𝑥 ⊆ ∪ 𝑦)
14	11, 12, 13	syl2anc 584	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin) → ∃𝑦 ∈ (𝒫 𝑠 ∩ Fin)𝑥 ⊆ ∪ 𝑦)
15	14	ad2antll 727	. . . . . . . 8 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) → ∃𝑦 ∈ (𝒫 𝑠 ∩ Fin)𝑥 ⊆ ∪ 𝑦)
16	1	ad3antrrr 728	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → 𝐶 ∈ (Moore‘𝑋))
17		eqid 2732	. . . . . . . . . 10 ⊢ (mrCls‘𝐶) = (mrCls‘𝐶)
18		simprr 771	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → 𝑥 ⊆ ∪ 𝑦)
19		elinel1 4194	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) → 𝑦 ∈ 𝒫 𝑠)
20	19	elpwid 4610	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) → 𝑦 ⊆ 𝑠)
21	20	unissd 4917	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) → ∪ 𝑦 ⊆ ∪ 𝑠)
22	21	ad2antrl 726	. . . . . . . . . . 11 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ∪ 𝑦 ⊆ ∪ 𝑠)
23	8	ad2antrr 724	. . . . . . . . . . 11 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ∪ 𝑠 ⊆ 𝑋)
24	22, 23	sstrd 3991	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ∪ 𝑦 ⊆ 𝑋)
25	16, 17, 18, 24	mrcssd 17564	. . . . . . . . 9 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ((mrCls‘𝐶)‘𝑥) ⊆ ((mrCls‘𝐶)‘∪ 𝑦))
26		simpl 483	. . . . . . . . . . . . . . 15 ⊢ (((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin)) → (toInc‘𝑠) ∈ Dirset)
27	20	adantl 482	. . . . . . . . . . . . . . 15 ⊢ (((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin)) → 𝑦 ⊆ 𝑠)
28		elinel2 4195	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) → 𝑦 ∈ Fin)
29	28	adantl 482	. . . . . . . . . . . . . . 15 ⊢ (((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin)) → 𝑦 ∈ Fin)
30		ipodrsfi 18488	. . . . . . . . . . . . . . 15 ⊢ (((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ⊆ 𝑠 ∧ 𝑦 ∈ Fin) → ∃𝑥 ∈ 𝑠 ∪ 𝑦 ⊆ 𝑥)
31	26, 27, 29, 30	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ (((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin)) → ∃𝑥 ∈ 𝑠 ∪ 𝑦 ⊆ 𝑥)
32	31	adantl 482	. . . . . . . . . . . . 13 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) → ∃𝑥 ∈ 𝑠 ∪ 𝑦 ⊆ 𝑥)
33	1	ad3antrrr 728	. . . . . . . . . . . . . . 15 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → 𝐶 ∈ (Moore‘𝑋))
34		simprr 771	. . . . . . . . . . . . . . 15 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → ∪ 𝑦 ⊆ 𝑥)
35		elpwi 4608	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 ∈ 𝒫 𝐶 → 𝑠 ⊆ 𝐶)
36	35	adantl 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) → 𝑠 ⊆ 𝐶)
37	36	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → 𝑠 ⊆ 𝐶)
38		simprl 769	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → 𝑥 ∈ 𝑠)
39	37, 38	sseldd 3982	. . . . . . . . . . . . . . 15 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → 𝑥 ∈ 𝐶)
40	17	mrcsscl 17560	. . . . . . . . . . . . . . 15 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∪ 𝑦 ⊆ 𝑥 ∧ 𝑥 ∈ 𝐶) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ 𝑥)
41	33, 34, 39, 40	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ 𝑥)
42		elssuni 4940	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑠 → 𝑥 ⊆ ∪ 𝑠)
43	42	ad2antrl 726	. . . . . . . . . . . . . 14 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → 𝑥 ⊆ ∪ 𝑠)
44	41, 43	sstrd 3991	. . . . . . . . . . . . 13 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) ∧ (𝑥 ∈ 𝑠 ∧ ∪ 𝑦 ⊆ 𝑥)) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ ∪ 𝑠)
45	32, 44	rexlimddv 3161	. . . . . . . . . . . 12 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin))) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ ∪ 𝑠)
46	45	anassrs 468	. . . . . . . . . . 11 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) ∧ 𝑦 ∈ (𝒫 𝑠 ∩ Fin)) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ ∪ 𝑠)
47	46	adantrr 715	. . . . . . . . . 10 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ ∪ 𝑠)
48	47	adantlrr 719	. . . . . . . . 9 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ((mrCls‘𝐶)‘∪ 𝑦) ⊆ ∪ 𝑠)
49	25, 48	sstrd 3991	. . . . . . . 8 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) ∧ (𝑦 ∈ (𝒫 𝑠 ∩ Fin) ∧ 𝑥 ⊆ ∪ 𝑦)) → ((mrCls‘𝐶)‘𝑥) ⊆ ∪ 𝑠)
50	15, 49	rexlimddv 3161	. . . . . . 7 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ ((toInc‘𝑠) ∈ Dirset ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin))) → ((mrCls‘𝐶)‘𝑥) ⊆ ∪ 𝑠)
51	50	anassrs 468	. . . . . 6 ⊢ ((((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) ∧ 𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin)) → ((mrCls‘𝐶)‘𝑥) ⊆ ∪ 𝑠)
52	51	ralrimiva 3146	. . . . 5 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) → ∀𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin)((mrCls‘𝐶)‘𝑥) ⊆ ∪ 𝑠)
53	17	acsfiel 17594	. . . . . 6 ⊢ (𝐶 ∈ (ACS‘𝑋) → (∪ 𝑠 ∈ 𝐶 ↔ (∪ 𝑠 ⊆ 𝑋 ∧ ∀𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin)((mrCls‘𝐶)‘𝑥) ⊆ ∪ 𝑠)))
54	53	ad2antrr 724	. . . . 5 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) → (∪ 𝑠 ∈ 𝐶 ↔ (∪ 𝑠 ⊆ 𝑋 ∧ ∀𝑥 ∈ (𝒫 ∪ 𝑠 ∩ Fin)((mrCls‘𝐶)‘𝑥) ⊆ ∪ 𝑠)))
55	9, 52, 54	mpbir2and 711	. . . 4 ⊢ (((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) ∧ (toInc‘𝑠) ∈ Dirset) → ∪ 𝑠 ∈ 𝐶)
56	55	ex 413	. . 3 ⊢ ((𝐶 ∈ (ACS‘𝑋) ∧ 𝑠 ∈ 𝒫 𝐶) → ((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶))
57	56	ralrimiva 3146	. 2 ⊢ (𝐶 ∈ (ACS‘𝑋) → ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶))
58	1, 57	jca 512	1 ⊢ (𝐶 ∈ (ACS‘𝑋) → (𝐶 ∈ (Moore‘𝑋) ∧ ∀𝑠 ∈ 𝒫 𝐶((toInc‘𝑠) ∈ Dirset → ∪ 𝑠 ∈ 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ∩ cin 3946 ⊆ wss 3947 𝒫 cpw 4601 ∪ cuni 4907 ‘cfv 6540 Fincfn 8935 Moorecmre 17522 mrClscmrc 17523 ACScacs 17525 Dirsetcdrs 18243 toInccipo 18476

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 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 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-fz 13481 df-struct 17076 df-slot 17111 df-ndx 17123 df-base 17141 df-tset 17212 df-ple 17213 df-ocomp 17214 df-mre 17526 df-mrc 17527 df-acs 17529 df-proset 18244 df-drs 18245 df-poset 18262 df-ipo 18477

This theorem is referenced by: acsdrsel 18492 acsdrscl 18495 acsficl 18496 isacs5 18497 isacs4 18498 isacs3 18499

W3C validator