Theorem fsplit 8131

Description: A function that can be used to feed a common value to both operands of an operation. Use as the second argument of a composition with the function of fpar 8130 in order to build compound functions such as (𝑥 ∈ (0[,)+∞) ↦ ((√‘𝑥) + (sin‘𝑥))). (Contributed by NM, 17-Sep-2007.) Replace use of dfid2 5547 with df-id 5545. (Revised by BJ, 31-Dec-2023.)

Assertion

Ref	Expression
fsplit	⊢ ◡(1st ↾ I ) = (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩)

Proof of Theorem fsplit

Dummy variables 𝑦 𝑧 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3454	. . . . 5 ⊢ 𝑥 ∈ V
2		vex 3454	. . . . 5 ⊢ 𝑦 ∈ V
3	1, 2	brcnv 5859	. . . 4 ⊢ (𝑥◡(1st ↾ I )𝑦 ↔ 𝑦(1st ↾ I )𝑥)
4	1	brresi 5978	. . . 4 ⊢ (𝑦(1st ↾ I )𝑥 ↔ (𝑦 ∈ I ∧ 𝑦1st 𝑥))
5		19.42v 1985	. . . . . 6 ⊢ (∃𝑧((1st ‘𝑦) = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ ((1st ‘𝑦) = 𝑥 ∧ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩))
6		vex 3454	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
7	6, 6	op1std 8012	. . . . . . . . 9 ⊢ (𝑦 = ⟨𝑧, 𝑧⟩ → (1st ‘𝑦) = 𝑧)
8	7	eqeq1d 2762	. . . . . . . 8 ⊢ (𝑦 = ⟨𝑧, 𝑧⟩ → ((1st ‘𝑦) = 𝑥 ↔ 𝑧 = 𝑥))
9	8	pm5.32ri 586	. . . . . . 7 ⊢ (((1st ‘𝑦) = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ (𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
10	9	exbii 1880	. . . . . 6 ⊢ (∃𝑧((1st ‘𝑦) = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
11		fo1st 8022	. . . . . . . . 9 ⊢ 1st :V–onto→V
12		fofn 6799	. . . . . . . . 9 ⊢ (1st :V–onto→V → 1st Fn V)
13	11, 12	ax-mp 5	. . . . . . . 8 ⊢ 1st Fn V
14		fnbrfvb 6936	. . . . . . . 8 ⊢ ((1st Fn V ∧ 𝑦 ∈ V) → ((1st ‘𝑦) = 𝑥 ↔ 𝑦1st 𝑥))
15	13, 2, 14	mp2an 705	. . . . . . 7 ⊢ ((1st ‘𝑦) = 𝑥 ↔ 𝑦1st 𝑥)
16		df-id 5545	. . . . . . . . 9 ⊢ I = {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡}
17	16	eleq2i 2852	. . . . . . . 8 ⊢ (𝑦 ∈ I ↔ 𝑦 ∈ {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡})
18		elopab 5500	. . . . . . . 8 ⊢ (𝑦 ∈ {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡} ↔ ∃𝑧∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡))
19		ancom 466	. . . . . . . . . . . 12 ⊢ ((𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ (𝑧 = 𝑡 ∧ 𝑦 = ⟨𝑧, 𝑡⟩))
20		equcom 2050	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑡 ↔ 𝑡 = 𝑧)
21	20	anbi1i 636	. . . . . . . . . . . 12 ⊢ ((𝑧 = 𝑡 ∧ 𝑦 = ⟨𝑧, 𝑡⟩) ↔ (𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑡⟩))
22		opeq2 4840	. . . . . . . . . . . . . 14 ⊢ (𝑡 = 𝑧 → ⟨𝑧, 𝑡⟩ = ⟨𝑧, 𝑧⟩)
23	22	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑧 → (𝑦 = ⟨𝑧, 𝑡⟩ ↔ 𝑦 = ⟨𝑧, 𝑧⟩))
24	23	pm5.32i 585	. . . . . . . . . . . 12 ⊢ ((𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑡⟩) ↔ (𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
25	19, 21, 24	3bitri 300	. . . . . . . . . . 11 ⊢ ((𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ (𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
26	25	exbii 1880	. . . . . . . . . 10 ⊢ (∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ ∃𝑡(𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
27		biidd 265	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑧 → (𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 = ⟨𝑧, 𝑧⟩))
28	27	equsexvw 2037	. . . . . . . . . 10 ⊢ (∃𝑡(𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ 𝑦 = ⟨𝑧, 𝑧⟩)
29	26, 28	bitri 278	. . . . . . . . 9 ⊢ (∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ 𝑦 = ⟨𝑧, 𝑧⟩)
30	29	exbii 1880	. . . . . . . 8 ⊢ (∃𝑧∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩)
31	17, 18, 30	3bitrri 301	. . . . . . 7 ⊢ (∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 ∈ I )
32	15, 31	anbi12ci 641	. . . . . 6 ⊢ (((1st ‘𝑦) = 𝑥 ∧ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩) ↔ (𝑦 ∈ I ∧ 𝑦1st 𝑥))
33	5, 10, 32	3bitr3ri 305	. . . . 5 ⊢ ((𝑦 ∈ I ∧ 𝑦1st 𝑥) ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
34		id 23	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → 𝑧 = 𝑥)
35	34, 34	opeq12d 4847	. . . . . . 7 ⊢ (𝑧 = 𝑥 → ⟨𝑧, 𝑧⟩ = ⟨𝑥, 𝑥⟩)
36	35	eqeq2d 2771	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 = ⟨𝑥, 𝑥⟩))
37	36	equsexvw 2037	. . . . 5 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
38	33, 37	bitri 278	. . . 4 ⊢ ((𝑦 ∈ I ∧ 𝑦1st 𝑥) ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
39	3, 4, 38	3bitri 300	. . 3 ⊢ (𝑥◡(1st ↾ I )𝑦 ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
40	39	opabbii 5171	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥◡(1st ↾ I )𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = ⟨𝑥, 𝑥⟩}
41		relcnv 6099	. . 3 ⊢ Rel ◡(1st ↾ I )
42		dfrel4v 6181	. . 3 ⊢ (Rel ◡(1st ↾ I ) ↔ ◡(1st ↾ I ) = {⟨𝑥, 𝑦⟩ ∣ 𝑥◡(1st ↾ I )𝑦})
43	41, 42	mpbi 233	. 2 ⊢ ◡(1st ↾ I ) = {⟨𝑥, 𝑦⟩ ∣ 𝑥◡(1st ↾ I )𝑦}
44		mptv 5210	. 2 ⊢ (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩) = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = ⟨𝑥, 𝑥⟩}
45	40, 43, 44	3eqtr4i 2793	1 ⊢ ◡(1st ↾ I ) = (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  Vcvv 3450  ⟨cop 4834   class class class wbr 5102  {copab 5166   ↦ cmpt 5185   I cid 5544  ^◡ccnv 5649   ↾ cres 5652  Rel wrel 5655   Fn wfn 6534  –onto→wfo 6537  ‘cfv 6539  1^st c1st 8000

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fo 6545  df-fv 6547  df-1st 8002

This theorem is used by:  fsplitfpar  8132