Theorem funcestrcsetclem8 18198

Description: Lemma 8 for funcestrcsetc 18200. (Contributed by AV, 15-Feb-2020.)

Hypotheses

Ref	Expression
funcestrcsetc.e	⊢ 𝐸 = (ExtStrCat‘𝑈)
funcestrcsetc.s	⊢ 𝑆 = (SetCat‘𝑈)
funcestrcsetc.b	⊢ 𝐵 = (Base‘𝐸)
funcestrcsetc.c	⊢ 𝐶 = (Base‘𝑆)
funcestrcsetc.u	⊢ (𝜑 → 𝑈 ∈ WUni)
funcestrcsetc.f	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
funcestrcsetc.g	⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥)))))

Assertion

Ref	Expression
funcestrcsetclem8	⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐺𝑌):(𝑋(Hom ‘𝐸)𝑌)⟶((𝐹‘𝑋)(Hom ‘𝑆)(𝐹‘𝑌)))

Distinct variable groups:   𝑥,𝐵   𝑥,𝑋   𝜑,𝑥   𝑥,𝐶   𝑦,𝐵,𝑥   𝑦,𝑋   𝜑,𝑦   𝑥,𝑌,𝑦

Allowed substitution hints:   𝐶(𝑦)   𝑆(𝑥,𝑦)   𝑈(𝑥,𝑦)   𝐸(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)

Proof of Theorem funcestrcsetclem8

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1oi 6859	. . . 4 ⊢ ( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))):((Base‘𝑌) ↑m (Base‘𝑋))–1-1-onto→((Base‘𝑌) ↑m (Base‘𝑋))
2		f1of 6820	. . . 4 ⊢ (( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))):((Base‘𝑌) ↑m (Base‘𝑋))–1-1-onto→((Base‘𝑌) ↑m (Base‘𝑋)) → ( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))):((Base‘𝑌) ↑m (Base‘𝑋))⟶((Base‘𝑌) ↑m (Base‘𝑋)))
3	1, 2	mp1i 14	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))):((Base‘𝑌) ↑m (Base‘𝑋))⟶((Base‘𝑌) ↑m (Base‘𝑋)))
4		elmapi 8842	. . . . 5 ⊢ (𝑓 ∈ ((Base‘𝑌) ↑m (Base‘𝑋)) → 𝑓:(Base‘𝑋)⟶(Base‘𝑌))
5		fvex 6894	. . . . . . . . . 10 ⊢ (Base‘𝑌) ∈ V
6		fvex 6894	. . . . . . . . . 10 ⊢ (Base‘𝑋) ∈ V
7	5, 6	pm3.2i 475	. . . . . . . . 9 ⊢ ((Base‘𝑌) ∈ V ∧ (Base‘𝑋) ∈ V)
8		elmapg 8832	. . . . . . . . . 10 ⊢ (((Base‘𝑌) ∈ V ∧ (Base‘𝑋) ∈ V) → (𝑓 ∈ ((Base‘𝑌) ↑m (Base‘𝑋)) ↔ 𝑓:(Base‘𝑋)⟶(Base‘𝑌)))
9	8	bicomd 226	. . . . . . . . 9 ⊢ (((Base‘𝑌) ∈ V ∧ (Base‘𝑋) ∈ V) → (𝑓:(Base‘𝑋)⟶(Base‘𝑌) ↔ 𝑓 ∈ ((Base‘𝑌) ↑m (Base‘𝑋))))
10	7, 9	mp1i 14	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑓:(Base‘𝑋)⟶(Base‘𝑌) ↔ 𝑓 ∈ ((Base‘𝑌) ↑m (Base‘𝑋))))
11	10	biimpa 481	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑓:(Base‘𝑋)⟶(Base‘𝑌)) → 𝑓 ∈ ((Base‘𝑌) ↑m (Base‘𝑋)))
12		funcestrcsetc.e	. . . . . . . . . . 11 ⊢ 𝐸 = (ExtStrCat‘𝑈)
13		funcestrcsetc.s	. . . . . . . . . . 11 ⊢ 𝑆 = (SetCat‘𝑈)
14		funcestrcsetc.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝐸)
15		funcestrcsetc.c	. . . . . . . . . . 11 ⊢ 𝐶 = (Base‘𝑆)
16		funcestrcsetc.u	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑈 ∈ WUni)
17		funcestrcsetc.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥)))
18	12, 13, 14, 15, 16, 17	funcestrcsetclem1 18191	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝐵) → (𝐹‘𝑌) = (Base‘𝑌))
19	18	adantrl 728	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘𝑌) = (Base‘𝑌))
20	12, 13, 14, 15, 16, 17	funcestrcsetclem1 18191	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) = (Base‘𝑋))
21	20	adantrr 729	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘𝑋) = (Base‘𝑋))
22	19, 21	oveq12d 7428	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝐹‘𝑌) ↑m (𝐹‘𝑋)) = ((Base‘𝑌) ↑m (Base‘𝑋)))
23	22	adantr 485	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑓:(Base‘𝑋)⟶(Base‘𝑌)) → ((𝐹‘𝑌) ↑m (𝐹‘𝑋)) = ((Base‘𝑌) ↑m (Base‘𝑋)))
24	11, 23	eleqtrrd 2866	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑓:(Base‘𝑋)⟶(Base‘𝑌)) → 𝑓 ∈ ((𝐹‘𝑌) ↑m (𝐹‘𝑋)))
25	24	ex 417	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑓:(Base‘𝑋)⟶(Base‘𝑌) → 𝑓 ∈ ((𝐹‘𝑌) ↑m (𝐹‘𝑋))))
26	4, 25	syl5 35	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑓 ∈ ((Base‘𝑌) ↑m (Base‘𝑋)) → 𝑓 ∈ ((𝐹‘𝑌) ↑m (𝐹‘𝑋))))
27	26	ssrdv 3943	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((Base‘𝑌) ↑m (Base‘𝑋)) ⊆ ((𝐹‘𝑌) ↑m (𝐹‘𝑋)))
28	3, 27	fssd 6723	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))):((Base‘𝑌) ↑m (Base‘𝑋))⟶((𝐹‘𝑌) ↑m (𝐹‘𝑋)))
29		funcestrcsetc.g	. . . 4 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥)))))
30		eqid 2763	. . . 4 ⊢ (Base‘𝑋) = (Base‘𝑋)
31		eqid 2763	. . . 4 ⊢ (Base‘𝑌) = (Base‘𝑌)
32	12, 13, 14, 15, 16, 17, 29, 30, 31	funcestrcsetclem5 18195	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐺𝑌) = ( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))))
33	16	adantr 485	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑈 ∈ WUni)
34		eqid 2763	. . . 4 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸)
35	12, 16	estrcbas 18176	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 = (Base‘𝐸))
36	14, 35	eqtr4id 2817	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = 𝑈)
37	36	eleq2d 2849	. . . . . . 7 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ↔ 𝑋 ∈ 𝑈))
38	37	biimpcd 252	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝜑 → 𝑋 ∈ 𝑈))
39	38	adantr 485	. . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝜑 → 𝑋 ∈ 𝑈))
40	39	impcom 412	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝑈)
41	36	eleq2d 2849	. . . . . . 7 ⊢ (𝜑 → (𝑌 ∈ 𝐵 ↔ 𝑌 ∈ 𝑈))
42	41	biimpd 232	. . . . . 6 ⊢ (𝜑 → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
43	42	adantld 495	. . . . 5 ⊢ (𝜑 → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝑈))
44	43	imp 411	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝑈)
45	12, 33, 34, 40, 44, 30, 31	estrchom 18178	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(Hom ‘𝐸)𝑌) = ((Base‘𝑌) ↑m (Base‘𝑋)))
46		eqid 2763	. . . 4 ⊢ (Hom ‘𝑆) = (Hom ‘𝑆)
47	12, 13, 14, 15, 16, 17	funcestrcsetclem2 18192	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ 𝑈)
48	47	adantrr 729	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘𝑋) ∈ 𝑈)
49	12, 13, 14, 15, 16, 17	funcestrcsetclem2 18192	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝐵) → (𝐹‘𝑌) ∈ 𝑈)
50	49	adantrl 728	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘𝑌) ∈ 𝑈)
51	13, 33, 46, 48, 50	setchom 18132	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝐹‘𝑋)(Hom ‘𝑆)(𝐹‘𝑌)) = ((𝐹‘𝑌) ↑m (𝐹‘𝑋)))
52	32, 45, 51	feq123d 6694	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋𝐺𝑌):(𝑋(Hom ‘𝐸)𝑌)⟶((𝐹‘𝑋)(Hom ‘𝑆)(𝐹‘𝑌)) ↔ ( I ↾ ((Base‘𝑌) ↑m (Base‘𝑋))):((Base‘𝑌) ↑m (Base‘𝑋))⟶((𝐹‘𝑌) ↑m (𝐹‘𝑋))))
53	28, 52	mpbird 260	1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐺𝑌):(𝑋(Hom ‘𝐸)𝑌)⟶((𝐹‘𝑋)(Hom ‘𝑆)(𝐹‘𝑌)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ↦ cmpt 5192   I cid 5555   ↾ cres 5663  ⟶wf 6532  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7410   ∈ cmpo 7412   ↑_m cmap 8820  WUnicwun 10680  Basecbs 17264  Hom chom 17316  SetCatcsetc 18127  ExtStrCatcestrc 18173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  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 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-wun 10682  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-nn 12229  df-2 12298  df-3 12299  df-4 12300  df-5 12301  df-6 12302  df-7 12303  df-8 12304  df-9 12305  df-n0 12500  df-z 12587  df-dec 12707  df-uz 12858  df-fz 13531  df-struct 17202  df-slot 17237  df-ndx 17249  df-base 17265  df-hom 17329  df-cco 17330  df-setc 18128  df-estrc 18174

This theorem is referenced by:  funcestrcsetc  18200  fthestrcsetc  18201  fullestrcsetc  18202