Theorem fsplit 8140

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 8139 in order to build compound functions such as (𝑥 ∈ (0[,)+∞) ↦ ((√‘𝑥) + (sin‘𝑥))). (Contributed by NM, 17-Sep-2007.) Replace use of dfid2 5584 with df-id 5582. (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 3481	. . . . 5 ⊢ 𝑥 ∈ V
2		vex 3481	. . . . 5 ⊢ 𝑦 ∈ V
3	1, 2	brcnv 5895	. . . 4 ⊢ (𝑥◡(1st ↾ I )𝑦 ↔ 𝑦(1st ↾ I )𝑥)
4	1	brresi 6008	. . . 4 ⊢ (𝑦(1st ↾ I )𝑥 ↔ (𝑦 ∈ I ∧ 𝑦1st 𝑥))
5		19.42v 1950	. . . . . 6 ⊢ (∃𝑧((1st ‘𝑦) = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ ((1st ‘𝑦) = 𝑥 ∧ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩))
6		vex 3481	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
7	6, 6	op1std 8022	. . . . . . . . 9 ⊢ (𝑦 = ⟨𝑧, 𝑧⟩ → (1st ‘𝑦) = 𝑧)
8	7	eqeq1d 2736	. . . . . . . 8 ⊢ (𝑦 = ⟨𝑧, 𝑧⟩ → ((1st ‘𝑦) = 𝑥 ↔ 𝑧 = 𝑥))
9	8	pm5.32ri 575	. . . . . . 7 ⊢ (((1st ‘𝑦) = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ (𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
10	9	exbii 1844	. . . . . 6 ⊢ (∃𝑧((1st ‘𝑦) = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
11		fo1st 8032	. . . . . . . . 9 ⊢ 1st :V–onto→V
12		fofn 6822	. . . . . . . . 9 ⊢ (1st :V–onto→V → 1st Fn V)
13	11, 12	ax-mp 5	. . . . . . . 8 ⊢ 1st Fn V
14		fnbrfvb 6959	. . . . . . . 8 ⊢ ((1st Fn V ∧ 𝑦 ∈ V) → ((1st ‘𝑦) = 𝑥 ↔ 𝑦1st 𝑥))
15	13, 2, 14	mp2an 692	. . . . . . 7 ⊢ ((1st ‘𝑦) = 𝑥 ↔ 𝑦1st 𝑥)
16		df-id 5582	. . . . . . . . 9 ⊢ I = {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡}
17	16	eleq2i 2830	. . . . . . . 8 ⊢ (𝑦 ∈ I ↔ 𝑦 ∈ {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡})
18		elopab 5536	. . . . . . . 8 ⊢ (𝑦 ∈ {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡} ↔ ∃𝑧∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡))
19		ancom 460	. . . . . . . . . . . 12 ⊢ ((𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ (𝑧 = 𝑡 ∧ 𝑦 = ⟨𝑧, 𝑡⟩))
20		equcom 2014	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑡 ↔ 𝑡 = 𝑧)
21	20	anbi1i 624	. . . . . . . . . . . 12 ⊢ ((𝑧 = 𝑡 ∧ 𝑦 = ⟨𝑧, 𝑡⟩) ↔ (𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑡⟩))
22		opeq2 4878	. . . . . . . . . . . . . 14 ⊢ (𝑡 = 𝑧 → ⟨𝑧, 𝑡⟩ = ⟨𝑧, 𝑧⟩)
23	22	eqeq2d 2745	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑧 → (𝑦 = ⟨𝑧, 𝑡⟩ ↔ 𝑦 = ⟨𝑧, 𝑧⟩))
24	23	pm5.32i 574	. . . . . . . . . . . 12 ⊢ ((𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑡⟩) ↔ (𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
25	19, 21, 24	3bitri 297	. . . . . . . . . . 11 ⊢ ((𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ (𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
26	25	exbii 1844	. . . . . . . . . 10 ⊢ (∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ ∃𝑡(𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
27		biidd 262	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑧 → (𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 = ⟨𝑧, 𝑧⟩))
28	27	equsexvw 2001	. . . . . . . . . 10 ⊢ (∃𝑡(𝑡 = 𝑧 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ 𝑦 = ⟨𝑧, 𝑧⟩)
29	26, 28	bitri 275	. . . . . . . . 9 ⊢ (∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ 𝑦 = ⟨𝑧, 𝑧⟩)
30	29	exbii 1844	. . . . . . . 8 ⊢ (∃𝑧∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩)
31	17, 18, 30	3bitrri 298	. . . . . . 7 ⊢ (∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 ∈ I )
32	15, 31	anbi12ci 629	. . . . . 6 ⊢ (((1st ‘𝑦) = 𝑥 ∧ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩) ↔ (𝑦 ∈ I ∧ 𝑦1st 𝑥))
33	5, 10, 32	3bitr3ri 302	. . . . 5 ⊢ ((𝑦 ∈ I ∧ 𝑦1st 𝑥) ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩))
34		id 22	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → 𝑧 = 𝑥)
35	34, 34	opeq12d 4885	. . . . . . 7 ⊢ (𝑧 = 𝑥 → ⟨𝑧, 𝑧⟩ = ⟨𝑥, 𝑥⟩)
36	35	eqeq2d 2745	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 = ⟨𝑥, 𝑥⟩))
37	36	equsexvw 2001	. . . . 5 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ 𝑦 = ⟨𝑧, 𝑧⟩) ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
38	33, 37	bitri 275	. . . 4 ⊢ ((𝑦 ∈ I ∧ 𝑦1st 𝑥) ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
39	3, 4, 38	3bitri 297	. . 3 ⊢ (𝑥◡(1st ↾ I )𝑦 ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
40	39	opabbii 5214	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥◡(1st ↾ I )𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = ⟨𝑥, 𝑥⟩}
41		relcnv 6124	. . 3 ⊢ Rel ◡(1st ↾ I )
42		dfrel4v 6211	. . 3 ⊢ (Rel ◡(1st ↾ I ) ↔ ◡(1st ↾ I ) = {⟨𝑥, 𝑦⟩ ∣ 𝑥◡(1st ↾ I )𝑦})
43	41, 42	mpbi 230	. 2 ⊢ ◡(1st ↾ I ) = {⟨𝑥, 𝑦⟩ ∣ 𝑥◡(1st ↾ I )𝑦}
44		mptv 5263	. 2 ⊢ (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩) = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = ⟨𝑥, 𝑥⟩}
45	40, 43, 44	3eqtr4i 2772	1 ⊢ ◡(1st ↾ I ) = (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩)

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1536  ∃wex 1775   ∈ wcel 2105  Vcvv 3477  ⟨cop 4636   class class class wbr 5147  {copab 5209   ↦ cmpt 5230   I cid 5581  ^◡ccnv 5687   ↾ cres 5690  Rel wrel 5693   Fn wfn 6557  –onto→wfo 6560  ‘cfv 6562  1^st c1st 8010

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437  ax-un 7753

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-fo 6568  df-fv 6570  df-1st 8012

This theorem is referenced by:  fsplitfpar  8141