Theorem fmucndlem 24246

Description: Lemma for fmucnd 24247. (Contributed by Thierry Arnoux, 19-Nov-2017.)

Assertion

Ref	Expression
fmucndlem	⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) “ (𝐴 × 𝐴)) = ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦   𝑥,𝑋,𝑦

Proof of Theorem fmucndlem

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ima 5645	. . 3 ⊢ ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) “ (𝐴 × 𝐴)) = ran ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↾ (𝐴 × 𝐴))
2		simpr 484	. . . . 5 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋)
3		resmpo 7488	. . . . 5 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩))
4	2, 3	sylancom 589	. . . 4 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩))
5	4	rneqd 5895	. . 3 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ran ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↾ (𝐴 × 𝐴)) = ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩))
6	1, 5	eqtrid 2784	. 2 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) “ (𝐴 × 𝐴)) = ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩))
7		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
8		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
9	7, 8	op1std 7953	. . . . . . . . . . . 12 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (1st ‘𝑝) = 𝑥)
10	9	fveq2d 6846	. . . . . . . . . . 11 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(1st ‘𝑝)) = (𝐹‘𝑥))
11	7, 8	op2ndd 7954	. . . . . . . . . . . 12 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (2nd ‘𝑝) = 𝑦)
12	11	fveq2d 6846	. . . . . . . . . . 11 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(2nd ‘𝑝)) = (𝐹‘𝑦))
13	10, 12	opeq12d 4839	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → ⟨(𝐹‘(1st ‘𝑝)), (𝐹‘(2nd ‘𝑝))⟩ = ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩)
14	13	mpompt 7482	. . . . . . . . 9 ⊢ (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st ‘𝑝)), (𝐹‘(2nd ‘𝑝))⟩) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩)
15	14	eqcomi 2746	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) = (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st ‘𝑝)), (𝐹‘(2nd ‘𝑝))⟩)
16	15	rneqi 5894	. . . . . . 7 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) = ran (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st ‘𝑝)), (𝐹‘(2nd ‘𝑝))⟩)
17		fvexd 6857	. . . . . . 7 ⊢ ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(1st ‘𝑝)) ∈ V)
18		fvexd 6857	. . . . . . 7 ⊢ ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(2nd ‘𝑝)) ∈ V)
19	16, 17, 18	fliftrel 7264	. . . . . 6 ⊢ (⊤ → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ⊆ (V × V))
20	19	mptru 1549	. . . . 5 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ⊆ (V × V)
21	20	sseli 3931	. . . 4 ⊢ (𝑝 ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) → 𝑝 ∈ (V × V))
22	21	adantl 481	. . 3 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩)) → 𝑝 ∈ (V × V))
23		xpss 5648	. . . . 5 ⊢ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)) ⊆ (V × V)
24	23	sseli 3931	. . . 4 ⊢ (𝑝 ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)) → 𝑝 ∈ (V × V))
25	24	adantl 481	. . 3 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴))) → 𝑝 ∈ (V × V))
26		eqid 2737	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩)
27		opex 5419	. . . . . . . . 9 ⊢ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ ∈ V
28	26, 27	elrnmpo 7504	. . . . . . . 8 ⊢ (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ = ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩)
29		eqcom 2744	. . . . . . . . . 10 ⊢ (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ = ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ ↔ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ = ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩)
30		fvex 6855	. . . . . . . . . . 11 ⊢ (1st ‘𝑝) ∈ V
31		fvex 6855	. . . . . . . . . . 11 ⊢ (2nd ‘𝑝) ∈ V
32	30, 31	opth2 5436	. . . . . . . . . 10 ⊢ (⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ = ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ↔ ((𝐹‘𝑥) = (1st ‘𝑝) ∧ (𝐹‘𝑦) = (2nd ‘𝑝)))
33	29, 32	bitri 275	. . . . . . . . 9 ⊢ (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ = ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ ↔ ((𝐹‘𝑥) = (1st ‘𝑝) ∧ (𝐹‘𝑦) = (2nd ‘𝑝)))
34	33	2rexbii 3114	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ = ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (1st ‘𝑝) ∧ (𝐹‘𝑦) = (2nd ‘𝑝)))
35		reeanv 3210	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (1st ‘𝑝) ∧ (𝐹‘𝑦) = (2nd ‘𝑝)) ↔ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = (1st ‘𝑝) ∧ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = (2nd ‘𝑝)))
36	28, 34, 35	3bitri 297	. . . . . . 7 ⊢ (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = (1st ‘𝑝) ∧ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = (2nd ‘𝑝)))
37		fvelimab 6914	. . . . . . . 8 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((1st ‘𝑝) ∈ (𝐹 “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = (1st ‘𝑝)))
38		fvelimab 6914	. . . . . . . 8 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((2nd ‘𝑝) ∈ (𝐹 “ 𝐴) ↔ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = (2nd ‘𝑝)))
39	37, 38	anbi12d 633	. . . . . . 7 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → (((1st ‘𝑝) ∈ (𝐹 “ 𝐴) ∧ (2nd ‘𝑝) ∈ (𝐹 “ 𝐴)) ↔ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = (1st ‘𝑝) ∧ ∃𝑦 ∈ 𝐴 (𝐹‘𝑦) = (2nd ‘𝑝))))
40	36, 39	bitr4id 290	. . . . . 6 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ ((1st ‘𝑝) ∈ (𝐹 “ 𝐴) ∧ (2nd ‘𝑝) ∈ (𝐹 “ 𝐴))))
41		opelxp 5668	. . . . . 6 ⊢ (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)) ↔ ((1st ‘𝑝) ∈ (𝐹 “ 𝐴) ∧ (2nd ‘𝑝) ∈ (𝐹 “ 𝐴)))
42	40, 41	bitr4di 289	. . . . 5 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴))))
43	42	adantr 480	. . . 4 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ (V × V)) → (⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴))))
44		1st2nd2 7982	. . . . . 6 ⊢ (𝑝 ∈ (V × V) → 𝑝 = ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩)
45	44	adantl 481	. . . . 5 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ (V × V)) → 𝑝 = ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩)
46	45	eleq1d 2822	. . . 4 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩)))
47	45	eleq1d 2822	. . . 4 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)) ↔ ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩ ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴))))
48	43, 46, 47	3bitr4d 311	. . 3 ⊢ (((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) ↔ 𝑝 ∈ ((𝐹 “ 𝐴) × (𝐹 “ 𝐴))))
49	22, 25, 48	eqrdav 2736	. 2 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) = ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)))
50	6, 49	eqtrd 2772	1 ⊢ ((𝐹 Fn 𝑋 ∧ 𝐴 ⊆ 𝑋) → ((𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ ⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩) “ (𝐴 × 𝐴)) = ((𝐹 “ 𝐴) × (𝐹 “ 𝐴)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ⊤wtru 1543   ∈ wcel 2114  ∃wrex 3062  Vcvv 3442   ⊆ wss 3903  ⟨cop 4588   ↦ cmpt 5181   × cxp 5630  ran crn 5633   ↾ cres 5634   “ cima 5635   Fn wfn 6495  ‘cfv 6500   ∈ cmpo 7370  1^st c1st 7941  2^nd c2nd 7942

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944

This theorem is referenced by:  fmucnd  24247