Theorem mclsind 35597

Description: Induction theorem for closure: any other set 𝑄 closed under the axioms and the hypotheses contains all the elements of the closure. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mclsval.d	⊢ 𝐷 = (mDV‘𝑇)
mclsval.e	⊢ 𝐸 = (mEx‘𝑇)
mclsval.c	⊢ 𝐶 = (mCls‘𝑇)
mclsval.1	⊢ (𝜑 → 𝑇 ∈ mFS)
mclsval.2	⊢ (𝜑 → 𝐾 ⊆ 𝐷)
mclsval.3	⊢ (𝜑 → 𝐵 ⊆ 𝐸)
mclsax.a	⊢ 𝐴 = (mAx‘𝑇)
mclsax.l	⊢ 𝐿 = (mSubst‘𝑇)
mclsax.v	⊢ 𝑉 = (mVR‘𝑇)
mclsax.h	⊢ 𝐻 = (mVH‘𝑇)
mclsax.w	⊢ 𝑊 = (mVars‘𝑇)
mclsind.4	⊢ (𝜑 → 𝐵 ⊆ 𝑄)
mclsind.5	⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝑄)
mclsind.6	⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑄)

Assertion

Ref	Expression
mclsind	⊢ (𝜑 → (𝐾𝐶𝐵) ⊆ 𝑄)

Distinct variable groups:   𝑚,𝑜,𝑝,𝑠,𝑣,𝐸   𝑥,𝑚,𝐻,𝑜,𝑝,𝑠,𝑣   𝑦,𝑚,𝐵,𝑜,𝑝,𝑠,𝑣,𝑥   𝐶,𝑚,𝑜,𝑝,𝑠,𝑣,𝑥   𝑚,𝐿,𝑜,𝑝,𝑠,𝑥,𝑦   𝐴,𝑚,𝑜,𝑝,𝑠   𝑇,𝑚,𝑜,𝑝,𝑠,𝑥,𝑦   𝜑,𝑚,𝑜,𝑝,𝑠,𝑣,𝑥,𝑦   𝑄,𝑚,𝑜,𝑝,𝑠,𝑣   𝑣,𝑉,𝑥   𝑚,𝑊,𝑜,𝑝,𝑠,𝑥   𝑚,𝐾,𝑜,𝑝,𝑠,𝑣,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑣)   𝐶(𝑦)   𝐷(𝑥,𝑦,𝑣,𝑚,𝑜,𝑠,𝑝)   𝑄(𝑥,𝑦)   𝑇(𝑣)   𝐸(𝑥,𝑦)   𝐻(𝑦)   𝐿(𝑣)   𝑉(𝑦,𝑚,𝑜,𝑠,𝑝)   𝑊(𝑦,𝑣)

Proof of Theorem mclsind

Dummy variable 𝑐 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mclsval.d	. . 3 ⊢ 𝐷 = (mDV‘𝑇)
2		mclsval.e	. . 3 ⊢ 𝐸 = (mEx‘𝑇)
3		mclsval.c	. . 3 ⊢ 𝐶 = (mCls‘𝑇)
4		mclsval.1	. . 3 ⊢ (𝜑 → 𝑇 ∈ mFS)
5		mclsval.2	. . 3 ⊢ (𝜑 → 𝐾 ⊆ 𝐷)
6		mclsval.3	. . 3 ⊢ (𝜑 → 𝐵 ⊆ 𝐸)
7		mclsax.h	. . 3 ⊢ 𝐻 = (mVH‘𝑇)
8		mclsax.a	. . 3 ⊢ 𝐴 = (mAx‘𝑇)
9		mclsax.l	. . 3 ⊢ 𝐿 = (mSubst‘𝑇)
10		mclsax.w	. . 3 ⊢ 𝑊 = (mVars‘𝑇)
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	mclsval 35590	. 2 ⊢ (𝜑 → (𝐾𝐶𝐵) = ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))})
12		mclsind.4	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝑄)
13	6, 12	ssind 4221	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ (𝐸 ∩ 𝑄))
14		mclsax.v	. . . . . . . . . . 11 ⊢ 𝑉 = (mVR‘𝑇)
15	14, 2, 7	mvhf 35585	. . . . . . . . . 10 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸)
16	4, 15	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐻:𝑉⟶𝐸)
17	16	ffnd 6712	. . . . . . . 8 ⊢ (𝜑 → 𝐻 Fn 𝑉)
18	16	ffvelcdmda 7079	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝐸)
19		mclsind.5	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝑄)
20	18, 19	elind 4180	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ (𝐸 ∩ 𝑄))
21	20	ralrimiva 3133	. . . . . . . 8 ⊢ (𝜑 → ∀𝑣 ∈ 𝑉 (𝐻‘𝑣) ∈ (𝐸 ∩ 𝑄))
22		ffnfv 7114	. . . . . . . 8 ⊢ (𝐻:𝑉⟶(𝐸 ∩ 𝑄) ↔ (𝐻 Fn 𝑉 ∧ ∀𝑣 ∈ 𝑉 (𝐻‘𝑣) ∈ (𝐸 ∩ 𝑄)))
23	17, 21, 22	sylanbrc 583	. . . . . . 7 ⊢ (𝜑 → 𝐻:𝑉⟶(𝐸 ∩ 𝑄))
24	23	frnd 6719	. . . . . 6 ⊢ (𝜑 → ran 𝐻 ⊆ (𝐸 ∩ 𝑄))
25	13, 24	unssd 4172	. . . . 5 ⊢ (𝜑 → (𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄))
26		id 22	. . . . . . . . . . . 12 ⊢ ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄))
27		inss2 4218	. . . . . . . . . . . 12 ⊢ (𝐸 ∩ 𝑄) ⊆ 𝑄
28	26, 27	sstrdi 3976	. . . . . . . . . . 11 ⊢ ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)
29	4	adantr 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑇 ∈ mFS)
30		eqid 2736	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (mREx‘𝑇) = (mREx‘𝑇)
31	14, 30, 9, 2	msubff 35557	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ mFS → 𝐿:((mREx‘𝑇) ↑pm 𝑉)⟶(𝐸 ↑m 𝐸))
32		frn 6718	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐿:((mREx‘𝑇) ↑pm 𝑉)⟶(𝐸 ↑m 𝐸) → ran 𝐿 ⊆ (𝐸 ↑m 𝐸))
33	29, 31, 32	3syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → ran 𝐿 ⊆ (𝐸 ↑m 𝐸))
34		simpr2 1196	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑠 ∈ ran 𝐿)
35	33, 34	sseldd 3964	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑠 ∈ (𝐸 ↑m 𝐸))
36		elmapi 8868	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 ∈ (𝐸 ↑m 𝐸) → 𝑠:𝐸⟶𝐸)
37	35, 36	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑠:𝐸⟶𝐸)
38		eqid 2736	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (mStat‘𝑇) = (mStat‘𝑇)
39	8, 38	maxsta 35581	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑇 ∈ mFS → 𝐴 ⊆ (mStat‘𝑇))
40	29, 39	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝐴 ⊆ (mStat‘𝑇))
41		eqid 2736	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
42	41, 38	mstapst 35574	. . . . . . . . . . . . . . . . . . . 20 ⊢ (mStat‘𝑇) ⊆ (mPreSt‘𝑇)
43	40, 42	sstrdi 3976	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝐴 ⊆ (mPreSt‘𝑇))
44		simpr1 1195	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴)
45	43, 44	sseldd 3964	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mPreSt‘𝑇))
46	1, 2, 41	elmpst 35563	. . . . . . . . . . . . . . . . . . 19 ⊢ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑚 ⊆ 𝐷 ∧ ◡𝑚 = 𝑚) ∧ (𝑜 ⊆ 𝐸 ∧ 𝑜 ∈ Fin) ∧ 𝑝 ∈ 𝐸))
47	46	simp3bi 1147	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mPreSt‘𝑇) → 𝑝 ∈ 𝐸)
48	45, 47	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑝 ∈ 𝐸)
49	37, 48	ffvelcdmd 7080	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → (𝑠‘𝑝) ∈ 𝐸)
50	49	3adant3 1132	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝐸)
51		mclsind.6	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑄)
52	50, 51	elind 4180	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))
53	52	3exp 1119	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
54	53	3expd 1354	. . . . . . . . . . . 12 ⊢ (𝜑 → (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → (𝑠 ∈ ran 𝐿 → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄 → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))))
55	54	imp31 417	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) ∧ 𝑠 ∈ ran 𝐿) → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄 → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
56	28, 55	syl5 34	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) ∧ 𝑠 ∈ ran 𝐿) → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
57	56	impd 410	. . . . . . . . 9 ⊢ (((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) ∧ 𝑠 ∈ ran 𝐿) → (((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))
58	57	ralrimiva 3133	. . . . . . . 8 ⊢ ((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))
59	58	ex 412	. . . . . . 7 ⊢ (𝜑 → (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
60	59	alrimiv 1927	. . . . . 6 ⊢ (𝜑 → ∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
61	60	alrimivv 1928	. . . . 5 ⊢ (𝜑 → ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
62	2	fvexi 6895	. . . . . . 7 ⊢ 𝐸 ∈ V
63	62	inex1 5292	. . . . . 6 ⊢ (𝐸 ∩ 𝑄) ∈ V
64		sseq2 3990	. . . . . . 7 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ↔ (𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄)))
65		sseq2 3990	. . . . . . . . . . . . 13 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ↔ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄)))
66	65	anbi1d 631	. . . . . . . . . . . 12 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) ↔ ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾))))
67		eleq2 2824	. . . . . . . . . . . 12 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((𝑠‘𝑝) ∈ 𝑐 ↔ (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))
68	66, 67	imbi12d 344	. . . . . . . . . . 11 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐) ↔ (((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
69	68	ralbidv 3164	. . . . . . . . . 10 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐) ↔ ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
70	69	imbi2d 340	. . . . . . . . 9 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)) ↔ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
71	70	albidv 1920	. . . . . . . 8 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)) ↔ ∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
72	71	2albidv 1923	. . . . . . 7 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)) ↔ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
73	64, 72	anbi12d 632	. . . . . 6 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐))) ↔ ((𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))))
74	63, 73	elab 3663	. . . . 5 ⊢ ((𝐸 ∩ 𝑄) ∈ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ↔ ((𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
75	25, 61, 74	sylanbrc 583	. . . 4 ⊢ (𝜑 → (𝐸 ∩ 𝑄) ∈ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))})
76		intss1 4944	. . . 4 ⊢ ((𝐸 ∩ 𝑄) ∈ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} → ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ⊆ (𝐸 ∩ 𝑄))
77	75, 76	syl 17	. . 3 ⊢ (𝜑 → ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ⊆ (𝐸 ∩ 𝑄))
78	77, 27	sstrdi 3976	. 2 ⊢ (𝜑 → ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ⊆ 𝑄)
79	11, 78	eqsstrd 3998	1 ⊢ (𝜑 → (𝐾𝐶𝐵) ⊆ 𝑄)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086  ∀wal 1538   = wceq 1540   ∈ wcel 2109  {cab 2714  ∀wral 3052   ∪ cun 3929   ∩ cin 3930   ⊆ wss 3931  ⟨cotp 4614  ∩ cint 4927   class class class wbr 5124   × cxp 5657  ^◡ccnv 5658  ran crn 5660   “ cima 5662   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8845   ↑_pm cpm 8846  Fincfn 8964  mVRcmvar 35488  mAxcmax 35492  mRExcmrex 35493  mExcmex 35494  mDVcmdv 35495  mVarscmvrs 35496  mSubstcmsub 35498  mVHcmvh 35499  mPreStcmpst 35500  mStatcmsta 35502  mFScmfs 35503  mClscmcls 35504

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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734  ax-cnex 11190  ax-resscn 11191  ax-1cn 11192  ax-icn 11193  ax-addcl 11194  ax-addrcl 11195  ax-mulcl 11196  ax-mulrcl 11197  ax-mulcom 11198  ax-addass 11199  ax-mulass 11200  ax-distr 11201  ax-i2m1 11202  ax-1ne0 11203  ax-1rid 11204  ax-rnegex 11205  ax-rrecex 11206  ax-cnre 11207  ax-pre-lttri 11208  ax-pre-lttrn 11209  ax-pre-ltadd 11210  ax-pre-mulgt0 11211

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-ot 4615  df-uni 4889  df-int 4928  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7867  df-1st 7993  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-1o 8485  df-er 8724  df-map 8847  df-pm 8848  df-en 8965  df-dom 8966  df-sdom 8967  df-fin 8968  df-card 9958  df-pnf 11276  df-mnf 11277  df-xr 11278  df-ltxr 11279  df-le 11280  df-sub 11473  df-neg 11474  df-nn 12246  df-2 12308  df-n0 12507  df-z 12594  df-uz 12858  df-fz 13530  df-fzo 13677  df-seq 14025  df-hash 14354  df-word 14537  df-concat 14594  df-s1 14619  df-struct 17171  df-sets 17188  df-slot 17206  df-ndx 17218  df-base 17234  df-ress 17257  df-plusg 17289  df-0g 17460  df-gsum 17461  df-mgm 18623  df-sgrp 18702  df-mnd 18718  df-submnd 18767  df-frmd 18832  df-mrex 35513  df-mex 35514  df-mrsub 35517  df-msub 35518  df-mvh 35519  df-mpst 35520  df-msr 35521  df-msta 35522  df-mfs 35523  df-mcls 35524

This theorem is referenced by:  mclspps  35611