MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fsplit Structured version   Visualization version   GIF version

Theorem fsplit 8099
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 8098 in order to build compound functions such as (𝑥 ∈ (0[,)+∞) ↦ ((√‘𝑥) + (sin‘𝑥))). (Contributed by NM, 17-Sep-2007.) Replace use of dfid2 5538 with df-id 5536. (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.
StepHypRef Expression
1 vex 3454 . . . . 5 𝑥 ∈ V
2 vex 3454 . . . . 5 𝑦 ∈ V
31, 2brcnv 5849 . . . 4 (𝑥(1st ↾ I )𝑦𝑦(1st ↾ I )𝑥)
41brresi 5962 . . . 4 (𝑦(1st ↾ I )𝑥 ↔ (𝑦 ∈ I ∧ 𝑦1st 𝑥))
5 19.42v 1953 . . . . . 6 (∃𝑧((1st𝑦) = 𝑥𝑦 = ⟨𝑧, 𝑧⟩) ↔ ((1st𝑦) = 𝑥 ∧ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩))
6 vex 3454 . . . . . . . . . 10 𝑧 ∈ V
76, 6op1std 7981 . . . . . . . . 9 (𝑦 = ⟨𝑧, 𝑧⟩ → (1st𝑦) = 𝑧)
87eqeq1d 2732 . . . . . . . 8 (𝑦 = ⟨𝑧, 𝑧⟩ → ((1st𝑦) = 𝑥𝑧 = 𝑥))
98pm5.32ri 575 . . . . . . 7 (((1st𝑦) = 𝑥𝑦 = ⟨𝑧, 𝑧⟩) ↔ (𝑧 = 𝑥𝑦 = ⟨𝑧, 𝑧⟩))
109exbii 1848 . . . . . 6 (∃𝑧((1st𝑦) = 𝑥𝑦 = ⟨𝑧, 𝑧⟩) ↔ ∃𝑧(𝑧 = 𝑥𝑦 = ⟨𝑧, 𝑧⟩))
11 fo1st 7991 . . . . . . . . 9 1st :V–onto→V
12 fofn 6777 . . . . . . . . 9 (1st :V–onto→V → 1st Fn V)
1311, 12ax-mp 5 . . . . . . . 8 1st Fn V
14 fnbrfvb 6914 . . . . . . . 8 ((1st Fn V ∧ 𝑦 ∈ V) → ((1st𝑦) = 𝑥𝑦1st 𝑥))
1513, 2, 14mp2an 692 . . . . . . 7 ((1st𝑦) = 𝑥𝑦1st 𝑥)
16 df-id 5536 . . . . . . . . 9 I = {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡}
1716eleq2i 2821 . . . . . . . 8 (𝑦 ∈ I ↔ 𝑦 ∈ {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡})
18 elopab 5490 . . . . . . . 8 (𝑦 ∈ {⟨𝑧, 𝑡⟩ ∣ 𝑧 = 𝑡} ↔ ∃𝑧𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡))
19 ancom 460 . . . . . . . . . . . 12 ((𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ (𝑧 = 𝑡𝑦 = ⟨𝑧, 𝑡⟩))
20 equcom 2018 . . . . . . . . . . . . 13 (𝑧 = 𝑡𝑡 = 𝑧)
2120anbi1i 624 . . . . . . . . . . . 12 ((𝑧 = 𝑡𝑦 = ⟨𝑧, 𝑡⟩) ↔ (𝑡 = 𝑧𝑦 = ⟨𝑧, 𝑡⟩))
22 opeq2 4841 . . . . . . . . . . . . . 14 (𝑡 = 𝑧 → ⟨𝑧, 𝑡⟩ = ⟨𝑧, 𝑧⟩)
2322eqeq2d 2741 . . . . . . . . . . . . 13 (𝑡 = 𝑧 → (𝑦 = ⟨𝑧, 𝑡⟩ ↔ 𝑦 = ⟨𝑧, 𝑧⟩))
2423pm5.32i 574 . . . . . . . . . . . 12 ((𝑡 = 𝑧𝑦 = ⟨𝑧, 𝑡⟩) ↔ (𝑡 = 𝑧𝑦 = ⟨𝑧, 𝑧⟩))
2519, 21, 243bitri 297 . . . . . . . . . . 11 ((𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ (𝑡 = 𝑧𝑦 = ⟨𝑧, 𝑧⟩))
2625exbii 1848 . . . . . . . . . 10 (∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ ∃𝑡(𝑡 = 𝑧𝑦 = ⟨𝑧, 𝑧⟩))
27 biidd 262 . . . . . . . . . . 11 (𝑡 = 𝑧 → (𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 = ⟨𝑧, 𝑧⟩))
2827equsexvw 2005 . . . . . . . . . 10 (∃𝑡(𝑡 = 𝑧𝑦 = ⟨𝑧, 𝑧⟩) ↔ 𝑦 = ⟨𝑧, 𝑧⟩)
2926, 28bitri 275 . . . . . . . . 9 (∃𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ 𝑦 = ⟨𝑧, 𝑧⟩)
3029exbii 1848 . . . . . . . 8 (∃𝑧𝑡(𝑦 = ⟨𝑧, 𝑡⟩ ∧ 𝑧 = 𝑡) ↔ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩)
3117, 18, 303bitrri 298 . . . . . . 7 (∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 ∈ I )
3215, 31anbi12ci 629 . . . . . 6 (((1st𝑦) = 𝑥 ∧ ∃𝑧 𝑦 = ⟨𝑧, 𝑧⟩) ↔ (𝑦 ∈ I ∧ 𝑦1st 𝑥))
335, 10, 323bitr3ri 302 . . . . 5 ((𝑦 ∈ I ∧ 𝑦1st 𝑥) ↔ ∃𝑧(𝑧 = 𝑥𝑦 = ⟨𝑧, 𝑧⟩))
34 id 22 . . . . . . . 8 (𝑧 = 𝑥𝑧 = 𝑥)
3534, 34opeq12d 4848 . . . . . . 7 (𝑧 = 𝑥 → ⟨𝑧, 𝑧⟩ = ⟨𝑥, 𝑥⟩)
3635eqeq2d 2741 . . . . . 6 (𝑧 = 𝑥 → (𝑦 = ⟨𝑧, 𝑧⟩ ↔ 𝑦 = ⟨𝑥, 𝑥⟩))
3736equsexvw 2005 . . . . 5 (∃𝑧(𝑧 = 𝑥𝑦 = ⟨𝑧, 𝑧⟩) ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
3833, 37bitri 275 . . . 4 ((𝑦 ∈ I ∧ 𝑦1st 𝑥) ↔ 𝑦 = ⟨𝑥, 𝑥⟩)
393, 4, 383bitri 297 . . 3 (𝑥(1st ↾ I )𝑦𝑦 = ⟨𝑥, 𝑥⟩)
4039opabbii 5177 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥(1st ↾ I )𝑦} = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = ⟨𝑥, 𝑥⟩}
41 relcnv 6078 . . 3 Rel (1st ↾ I )
42 dfrel4v 6166 . . 3 (Rel (1st ↾ I ) ↔ (1st ↾ I ) = {⟨𝑥, 𝑦⟩ ∣ 𝑥(1st ↾ I )𝑦})
4341, 42mpbi 230 . 2 (1st ↾ I ) = {⟨𝑥, 𝑦⟩ ∣ 𝑥(1st ↾ I )𝑦}
44 mptv 5216 . 2 (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩) = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = ⟨𝑥, 𝑥⟩}
4540, 43, 443eqtr4i 2763 1 (1st ↾ I ) = (𝑥 ∈ V ↦ ⟨𝑥, 𝑥⟩)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wex 1779  wcel 2109  Vcvv 3450  cop 4598   class class class wbr 5110  {copab 5172  cmpt 5191   I cid 5535  ccnv 5640  cres 5643  Rel wrel 5646   Fn wfn 6509  ontowfo 6512  cfv 6514  1st c1st 7969
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fo 6520  df-fv 6522  df-1st 7971
This theorem is referenced by:  fsplitfpar  8100
  Copyright terms: Public domain W3C validator