HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem f2ndres 4094
Description: Mapping of a restriction of the 2nd (second member of an ordered pair) function.
Assertion
Ref Expression
f2ndres |- (2nd |` (A X. B)):(A X. B)-->B

Proof of Theorem f2ndres
StepHypRef Expression
1 visset 1813 . . . . . . . 8 |- y e. V
2 visset 1813 . . . . . . . 8 |- z e. V
31, 2op2nda 3452 . . . . . . 7 |- U.ran {<.y, z>.} = z
43eleq1i 1537 . . . . . 6 |- (U.ran {<.y, z>.} e. B <-> z e. B)
54biimpr 152 . . . . 5 |- (z e. B -> U.ran {<.y, z>.} e. B)
65adantl 388 . . . 4 |- ((y e. A /\ z e. B) -> U.ran {<.y, z>.} e. B)
76rgen2 1723 . . 3 |- A.y e. A A.z e. B U.ran {<.y, z>.} e. B
8 sneq 2417 . . . . . . 7 |- (x = <.y, z>. -> {x} = {<.y, z>.})
98rneqd 3341 . . . . . 6 |- (x = <.y, z>. -> ran { x} = ran {<.y, z>.})
109unieqd 2512 . . . . 5 |- (x = <.y, z>. -> U.ran { x} = U.ran {<.y, z>.})
1110eleq1d 1540 . . . 4 |- (x = <.y, z>. -> (U.ran { x} e. B <-> U.ran {<.y, z>.} e. B))
1211ralxp 3218 . . 3 |- (A.x e. (A X. B)U.ran { x} e. B <-> A.y e. A A.z e. B U.ran {<.y, z>.} e. B)
137, 12mpbir 190 . 2 |- A.x e. (A X. B)U.ran { x} e. B
14 df-2nd 4080 . . . . 5 |- 2nd = {<.x, y>. | y = U.ran { x}}
15 reseq1 3368 . . . . 5 |- (2nd = {<.x, y>. | y = U.ran { x}} -> (2nd |` (A X. B)) = ({<.x, y>. | y = U.ran { x}} |` (A X. B)))
1614, 15ax-mp 7 . . . 4 |- (2nd |` (A X. B)) = ({<.x, y>. | y = U.ran { x}} |` (A X. B))
17 resopab 3395 . . . 4 |- ({<.x, y>. | y = U.ran { x}} |` (A X. B)) = {<.x, y>. | (x e. (A X. B) /\ y = U.ran { x})}
1816, 17eqtr 1495 . . 3 |- (2nd |` (A X. B)) = {<.x, y>. | (x e. (A X. B) /\ y = U.ran { x})}
1918fopab2 3823 . 2 |- (A.x e. (A X. B)U.ran { x} e. B <-> (2nd |` (A X. B)):(A X. B)-->B)
2013, 19mpbi 189 1 |- (2nd |` (A X. B)):(A X. B)-->B
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 956   e. wcel 958  A.wral 1645  {csn 2409  <.cop 2411  U.cuni 2503  {copab 2666   X. cxp 3168  ran crn 3171   |` cres 3172  -->wf 3178  2ndc2nd 4078
This theorem is referenced by:  2ndconst 4097
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-fv 3198  df-2nd 4080
Copyright terms: Public domain