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

Theorem op1stg 4077
Description: Extract the first member of an ordered pair.
Assertion
Ref Expression
op1stg |- (A e. C -> (1st` <.A, B>.) = A)

Proof of Theorem op1stg
StepHypRef Expression
1 opeq1 2483 . . . 4 |- (x = A -> <.x, B>. = <.A, B>.)
21fveq2d 3719 . . 3 |- (x = A -> (1st` <.x, B>.) = (1st`
<.A, B>.))
3 id 59 . . 3 |- (x = A -> x = A)
42, 3eqeq12d 1486 . 2 |- (x = A -> ((1st` <.x, B>.) = x <-> (1st`
<.A, B>.) = A))
5 visset 1809 . . 3 |- x e. V
65op1st 4075 . 2 |- (1st` <.x, B>.) = x
74, 6vtoclg 1843 1 |- (A e. C -> (1st` <.A, B>.) = A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 954   e. wcel 956  <.cop 2407  ` cfv 3177  1stc1st 4067
This theorem is referenced by:  eqop 4094  seqzfval 6477  vcoprne 8150
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-9 963  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-nul 2705  ax-pow 2737  ax-pr 2774  ax-un 2861
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-uni 2499  df-br 2615  df-opab 2662  df-id 2830  df-xp 3179  df-rel 3180  df-cnv 3181  df-co 3182  df-dm 3183  df-rn 3184  df-res 3185  df-ima 3186  df-fun 3187  df-fv 3193  df-1st 4069
Copyright terms: Public domain