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

Theorem 1st2nd 4114
Description: Reconstruction of a member of a relation in terms of its ordered pair components.
Assertion
Ref Expression
1st2nd |- ((Rel B /\ A e. B) -> A = <.(1st` A), (2nd` A)>.)

Proof of Theorem 1st2nd
StepHypRef Expression
1 ssel2 2067 . . 3 |- ((B (_ (V X. V) /\ A e. B) -> A e. (V X. V))
2 df-rel 3191 . . 3 |- (Rel B <-> B (_ (V X. V))
31, 2sylanb 451 . 2 |- ((Rel B /\ A e. B) -> A e. (V X. V))
4 elxp6 4108 . . 3 |- (A e. (V X. V) <-> (A = <.(1st` A), (2nd` A)>. /\ ((1st` A) e. V /\ (2nd` A) e. V)))
54pm3.26bi 322 . 2 |- (A e. (V X. V) -> A = <.(1st` A), (2nd` A)>.)
63, 5syl 10 1 |- ((Rel B /\ A e. B) -> A = <.(1st` A), (2nd` A)>.)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   = wceq 958   e. wcel 960  Vcvv 1814   (_ wss 2050  <.cop 2415   X. cxp 3174  Rel wrel 3181  ` cfv 3188  1stc1st 4083  2ndc2nd 4084
This theorem is referenced by:  2ndrn 4116  elopabi 4123  eloprabi 4124  nvop2 8223  nvvop 8224  nvop 8301  ipfval 8348  phop 8473  11st22nd 10448  eloi 10630
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-nul 2715  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-id 2841  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fv 3204  df-1st 4085  df-2nd 4086
Copyright terms: Public domain