ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df2nd2 GIF version

Theorem df2nd2 6450
Description: An alternate possible definition of the 2nd function. (Contributed by NM, 10-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
df2nd2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑦} = (2nd ↾ (V × V))
Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem df2nd2
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 fo2nd 6386 . . . . 5 2nd :V–onto→V
2 fofn 5615 . . . . 5 (2nd :V–onto→V → 2nd Fn V)
3 dffn5im 5745 . . . . 5 (2nd Fn V → 2nd = (𝑤 ∈ V ↦ (2nd𝑤)))
41, 2, 3mp2b 8 . . . 4 2nd = (𝑤 ∈ V ↦ (2nd𝑤))
5 mptv 4226 . . . 4 (𝑤 ∈ V ↦ (2nd𝑤)) = {⟨𝑤, 𝑧⟩ ∣ 𝑧 = (2nd𝑤)}
64, 5eqtri 2259 . . 3 2nd = {⟨𝑤, 𝑧⟩ ∣ 𝑧 = (2nd𝑤)}
76reseq1i 5057 . 2 (2nd ↾ (V × V)) = ({⟨𝑤, 𝑧⟩ ∣ 𝑧 = (2nd𝑤)} ↾ (V × V))
8 resopab 5105 . 2 ({⟨𝑤, 𝑧⟩ ∣ 𝑧 = (2nd𝑤)} ↾ (V × V)) = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝑧 = (2nd𝑤))}
9 vex 2824 . . . . 5 𝑥 ∈ V
10 vex 2824 . . . . 5 𝑦 ∈ V
119, 10op2ndd 6377 . . . 4 (𝑤 = ⟨𝑥, 𝑦⟩ → (2nd𝑤) = 𝑦)
1211eqeq2d 2250 . . 3 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑧 = (2nd𝑤) ↔ 𝑧 = 𝑦))
1312dfoprab3 6419 . 2 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝑧 = (2nd𝑤))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑦}
147, 8, 133eqtrri 2264 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑦} = (2nd ↾ (V × V))
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1402  wcel 2209  Vcvv 2821  cop 3711  {copab 4189  cmpt 4190   × cxp 4770  cres 4774   Fn wfn 5370  ontowfo 5373  cfv 5375  {coprab 6080  2nd c2nd 6367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fo 5381  df-fv 5383  df-oprab 6083  df-1st 6368  df-2nd 6369
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator