msubco - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > msubco		Structured version Visualization version GIF version

Theorem msubco 33493

Description: The composition of two substitutions is a substitution. (Contributed by Mario Carneiro, 18-Jul-2016.)

**Hypothesis**
Ref	Expression
msubco.s	⊢ 𝑆 = (mSubst‘𝑇)

**Assertion**
Ref	Expression
msubco	⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → (𝐹 ∘ 𝐺) ∈ ran 𝑆)

Proof of Theorem msubco Dummy variables 𝑓 𝑔 ℎ 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2738	. . . . 5 ⊢ (mEx‘𝑇) = (mEx‘𝑇)
2		eqid 2738	. . . . 5 ⊢ (mRSubst‘𝑇) = (mRSubst‘𝑇)
3		msubco.s	. . . . 5 ⊢ 𝑆 = (mSubst‘𝑇)
4	1, 2, 3	elmsubrn 33490	. . . 4 ⊢ ran 𝑆 = ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩))
5	4	eleq2i 2830	. . 3 ⊢ (𝐹 ∈ ran 𝑆 ↔ 𝐹 ∈ ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩)))
6		eqid 2738	. . . 4 ⊢ (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩)) = (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩))
7		fvex 6787	. . . . 5 ⊢ (mEx‘𝑇) ∈ V
8	7	mptex 7099	. . . 4 ⊢ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∈ V
9	6, 8	elrnmpti 5869	. . 3 ⊢ (𝐹 ∈ ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩)) ↔ ∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩))
10	5, 9	bitri 274	. 2 ⊢ (𝐹 ∈ ran 𝑆 ↔ ∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩))
11	1, 2, 3	elmsubrn 33490	. . . 4 ⊢ ran 𝑆 = ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩))
12	11	eleq2i 2830	. . 3 ⊢ (𝐺 ∈ ran 𝑆 ↔ 𝐺 ∈ ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)))
13		eqid 2738	. . . 4 ⊢ (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) = (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩))
14	7	mptex 7099	. . . 4 ⊢ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩) ∈ V
15	13, 14	elrnmpti 5869	. . 3 ⊢ (𝐺 ∈ ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) ↔ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩))
16	12, 15	bitri 274	. 2 ⊢ (𝐺 ∈ ran 𝑆 ↔ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩))
17		reeanv 3294	. . 3 ⊢ (∃𝑓 ∈ ran (mRSubst‘𝑇)∃𝑔 ∈ ran (mRSubst‘𝑇)(𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) ↔ (∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)))
18		simpr 485	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑦 ∈ (mEx‘𝑇))
19		eqid 2738	. . . . . . . . . . . . 13 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
20		eqid 2738	. . . . . . . . . . . . 13 ⊢ (mREx‘𝑇) = (mREx‘𝑇)
21	19, 1, 20	mexval 33464	. . . . . . . . . . . 12 ⊢ (mEx‘𝑇) = ((mTC‘𝑇) × (mREx‘𝑇))
22	18, 21	eleqtrdi 2849	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
23		xp1st 7863	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)) → (1^st ‘𝑦) ∈ (mTC‘𝑇))
24	22, 23	syl 17	. . . . . . . . . 10 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (1^st ‘𝑦) ∈ (mTC‘𝑇))
25	2, 20	mrsubf 33479	. . . . . . . . . . . 12 ⊢ (𝑔 ∈ ran (mRSubst‘𝑇) → 𝑔:(mREx‘𝑇)⟶(mREx‘𝑇))
26	25	ad2antlr 724	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑔:(mREx‘𝑇)⟶(mREx‘𝑇))
27		xp2nd 7864	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)) → (2^nd ‘𝑦) ∈ (mREx‘𝑇))
28	22, 27	syl 17	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (2^nd ‘𝑦) ∈ (mREx‘𝑇))
29	26, 28	ffvelrnd 6962	. . . . . . . . . 10 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (𝑔‘(2^nd ‘𝑦)) ∈ (mREx‘𝑇))
30		opelxpi 5626	. . . . . . . . . 10 ⊢ (((1^st ‘𝑦) ∈ (mTC‘𝑇) ∧ (𝑔‘(2^nd ‘𝑦)) ∈ (mREx‘𝑇)) → ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
31	24, 29, 30	syl2anc 584	. . . . . . . . 9 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
32	31, 21	eleqtrrdi 2850	. . . . . . . 8 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ ∈ (mEx‘𝑇))
33		eqidd 2739	. . . . . . . 8 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩))
34		eqidd 2739	. . . . . . . 8 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩))
35		fvex 6787	. . . . . . . . . 10 ⊢ (1^st ‘𝑦) ∈ V
36		fvex 6787	. . . . . . . . . 10 ⊢ (𝑔‘(2^nd ‘𝑦)) ∈ V
37	35, 36	op1std 7841	. . . . . . . . 9 ⊢ (𝑥 = ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ → (1^st ‘𝑥) = (1^st ‘𝑦))
38	35, 36	op2ndd 7842	. . . . . . . . . 10 ⊢ (𝑥 = ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ → (2^nd ‘𝑥) = (𝑔‘(2^nd ‘𝑦)))
39	38	fveq2d 6778	. . . . . . . . 9 ⊢ (𝑥 = ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ → (𝑓‘(2^nd ‘𝑥)) = (𝑓‘(𝑔‘(2^nd ‘𝑦))))
40	37, 39	opeq12d 4812	. . . . . . . 8 ⊢ (𝑥 = ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩ → ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩ = ⟨(1^st ‘𝑦), (𝑓‘(𝑔‘(2^nd ‘𝑦)))⟩)
41	32, 33, 34, 40	fmptco 7001	. . . . . . 7 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑓‘(𝑔‘(2^nd ‘𝑦)))⟩))
42		fvco3 6867	. . . . . . . . . 10 ⊢ ((𝑔:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ (2^nd ‘𝑦) ∈ (mREx‘𝑇)) → ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦)) = (𝑓‘(𝑔‘(2^nd ‘𝑦))))
43	26, 28, 42	syl2anc 584	. . . . . . . . 9 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦)) = (𝑓‘(𝑔‘(2^nd ‘𝑦))))
44	43	opeq2d 4811	. . . . . . . 8 ⊢ (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩ = ⟨(1^st ‘𝑦), (𝑓‘(𝑔‘(2^nd ‘𝑦)))⟩)
45	44	mpteq2dva 5174	. . . . . . 7 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑓‘(𝑔‘(2^nd ‘𝑦)))⟩))
46	41, 45	eqtr4d 2781	. . . . . 6 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩))
47	2	mrsubco 33483	. . . . . . . 8 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑓 ∘ 𝑔) ∈ ran (mRSubst‘𝑇))
48	7	mptex 7099	. . . . . . . 8 ⊢ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩) ∈ V
49		eqid 2738	. . . . . . . . 9 ⊢ (ℎ ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩)) = (ℎ ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩))
50		fveq1 6773	. . . . . . . . . . 11 ⊢ (ℎ = (𝑓 ∘ 𝑔) → (ℎ‘(2^nd ‘𝑦)) = ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦)))
51	50	opeq2d 4811	. . . . . . . . . 10 ⊢ (ℎ = (𝑓 ∘ 𝑔) → ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩ = ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩)
52	51	mpteq2dv 5176	. . . . . . . . 9 ⊢ (ℎ = (𝑓 ∘ 𝑔) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩))
53	49, 52	elrnmpt1s 5866	. . . . . . . 8 ⊢ (((𝑓 ∘ 𝑔) ∈ ran (mRSubst‘𝑇) ∧ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩) ∈ V) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩) ∈ ran (ℎ ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩)))
54	47, 48, 53	sylancl 586	. . . . . . 7 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩) ∈ ran (ℎ ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩)))
55	1, 2, 3	elmsubrn 33490	. . . . . . 7 ⊢ ran 𝑆 = ran (ℎ ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (ℎ‘(2^nd ‘𝑦))⟩))
56	54, 55	eleqtrrdi 2850	. . . . . 6 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), ((𝑓 ∘ 𝑔)‘(2^nd ‘𝑦))⟩) ∈ ran 𝑆)
57	46, 56	eqeltrd 2839	. . . . 5 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) ∈ ran 𝑆)
58		coeq1 5766	. . . . . . 7 ⊢ (𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) → (𝐹 ∘ 𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ 𝐺))
59		coeq2 5767	. . . . . . 7 ⊢ (𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ 𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)))
60	58, 59	sylan9eq 2798	. . . . . 6 ⊢ ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) → (𝐹 ∘ 𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)))
61	60	eleq1d 2823	. . . . 5 ⊢ ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) → ((𝐹 ∘ 𝐺) ∈ ran 𝑆 ↔ ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) ∈ ran 𝑆))
62	57, 61	syl5ibrcom 246	. . . 4 ⊢ ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) → (𝐹 ∘ 𝐺) ∈ ran 𝑆))
63	62	rexlimivv 3221	. . 3 ⊢ (∃𝑓 ∈ ran (mRSubst‘𝑇)∃𝑔 ∈ ran (mRSubst‘𝑇)(𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) → (𝐹 ∘ 𝐺) ∈ ran 𝑆)
64	17, 63	sylbir 234	. 2 ⊢ ((∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑥), (𝑓‘(2^nd ‘𝑥))⟩) ∧ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1^st ‘𝑦), (𝑔‘(2^nd ‘𝑦))⟩)) → (𝐹 ∘ 𝐺) ∈ ran 𝑆)
65	10, 16, 64	syl2anb 598	1 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → (𝐹 ∘ 𝐺) ∈ ran 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∃wrex 3065 Vcvv 3432 ⟨cop 4567 ↦ cmpt 5157 × cxp 5587 ran crn 5590 ∘ ccom 5593 ⟶wf 6429 ‘cfv 6433 1^st c1st 7829 2^nd c2nd 7830 mTCcmtc 33426 mRExcmrex 33428 mExcmex 33429 mRSubstcmrsub 33432 mSubstcmsub 33433

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-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

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-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 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 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-pm 8618 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-n0 12234 df-xnn0 12306 df-z 12320 df-uz 12583 df-fz 13240 df-fzo 13383 df-seq 13722 df-hash 14045 df-word 14218 df-lsw 14266 df-concat 14274 df-s1 14301 df-substr 14354 df-pfx 14384 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-0g 17152 df-gsum 17153 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-mhm 18430 df-submnd 18431 df-frmd 18488 df-vrmd 18489 df-mrex 33448 df-mex 33449 df-mrsub 33452 df-msub 33453

This theorem is referenced by: mclsppslem 33545

W3C validator