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

Theorem dmsnop 3328
Description: The domain of a singleton of an ordered pair is the singleton of the first member.
Assertion
Ref Expression
dmsnop |- dom {<.A, B>.} = {A}

Proof of Theorem dmsnop
StepHypRef Expression
1 visset 1813 . . . . . . . . 9 |- x e. V
2 visset 1813 . . . . . . . . 9 |- y e. V
31, 2opthg 2788 . . . . . . . 8 |- (B e. V -> (<.x, y>. = <.A, B>. <-> (x = A /\ y = B)))
4 opex 2782 . . . . . . . . 9 |- <.x, y>. e. V
54elsnc 2431 . . . . . . . 8 |- (<.x, y>. e. {<.A, B>.} <-> <.x, y>. = <.A, B>.)
63, 5syl5bb 532 . . . . . . 7 |- (B e. V -> (<.x, y>. e. {<.A, B>.} <-> (x = A /\ y = B)))
76exbidv 1279 . . . . . 6 |- (B e. V -> (E.y<.x, y>. e. {<.A, B>.} <-> E.y(x = A /\ y = B)))
8 19.42v 1308 . . . . . 6 |- (E.y(x = A /\ y = B) <-> (x = A /\ E.y y = B))
97, 8syl6bb 536 . . . . 5 |- (B e. V -> (E.y<.x, y>. e. {<.A, B>.} <-> (x = A /\ E.y y = B)))
10 isset 1814 . . . . . 6 |- (B e. V <-> E.y y = B)
11 iba 642 . . . . . 6 |- (E.y y = B -> (x = A <-> (x = A /\ E.y y = B)))
1210, 11sylbi 199 . . . . 5 |- (B e. V -> (x = A <-> (x = A /\ E.y y = B)))
139, 12bitr4d 531 . . . 4 |- (B e. V -> (E.y<.x, y>. e. {<.A, B>.} <-> x = A))
1413abbidv 1577 . . 3 |- (B e. V -> {x | E.y<.x, y>. e. {<.A, B>.}} = {x | x = A})
15 dfdm3 3302 . . 3 |- dom {<.A, B>.} = {x | E.y<.x, y>. e. {<.A, B>.}}
16 df-sn 2412 . . 3 |- {A} = {x | x = A}
1714, 15, 163eqtr4g 1531 . 2 |- (B e. V -> dom {<.A, B>.} = {A})
18 opprc2 2499 . . . 4 |- (-. B e. V -> <.A, B>. = <.A, A>.)
19 sneq 2417 . . . 4 |- (<.A, B>. = <.A, A>. -> {<.A, B>.} = {<.A, A>.})
20 dmeq 3311 . . . 4 |- ({<.A, B>.} = {<.A, A>.} -> dom {<.A, B>.} = dom {<.A, A>.})
2118, 19, 203syl 20 . . 3 |- (-. B e. V -> dom {<.A, B>.} = dom {<.A, A>.})
221, 2opthg 2788 . . . . . . . . . 10 |- (A e. V -> (<.x, y>. = <.A, A>. <-> (x = A /\ y = A)))
234elsnc 2431 . . . . . . . . . 10 |- (<.x, y>. e. {<.A, A>.} <-> <.x, y>. = <.A, A>.)
2422, 23syl5bb 532 . . . . . . . . 9 |- (A e. V -> (<.x, y>. e. {<.A, A>.} <-> (x = A /\ y = A)))
2524exbidv 1279 . . . . . . . 8 |- (A e. V -> (E.y<.x, y>. e. {<.A, A>.} <-> E.y(x = A /\ y = A)))
26 19.42v 1308 . . . . . . . 8 |- (E.y(x = A /\ y = A) <-> (x = A /\ E.y y = A))
2725, 26syl6bb 536 . . . . . . 7 |- (A e. V -> (E.y<.x, y>. e. {<.A, A>.} <-> (x = A /\ E.y y = A)))
28 isset 1814 . . . . . . . 8 |- (A e. V <-> E.y y = A)
29 iba 642 . . . . . . . 8 |- (E.y y = A -> (x = A <-> (x = A /\ E.y y = A)))
3028, 29sylbi 199 . . . . . . 7 |- (A e. V -> (x = A <-> (x = A /\ E.y y = A)))
3127, 30bitr4d 531 . . . . . 6 |- (A e. V -> (E.y<.x, y>. e. {<.A, A>.} <-> x = A))
3231abbidv 1577 . . . . 5 |- (A e. V -> {x | E.y<.x, y>. e. {<.A, A>.}} = {x | x = A})
33 dfdm3 3302 . . . . 5 |- dom {<.A, A>.} = {x | E.y<.x, y>. e. {<.A, A>.}}
3432, 33, 163eqtr4g 1531 . . . 4 |- (A e. V -> dom {<.A, A>.} = {A})
35 dmsnsn0 3325 . . . . 5 |- dom {{(/)}} = (/)
36 anidm 432 . . . . . . 7 |- ((-. A e. V /\ -. A e. V) <-> -. A e. V)
37 opprc3 2797 . . . . . . 7 |- ((-. A e. V /\ -. A e. V) <-> <.A, A>. = {(/)})
3836, 37bitr3 175 . . . . . 6 |- (-. A e. V <-> <.A, A>. = {(/)})
39 sneq 2417 . . . . . . 7 |- (<.A, A>. = {(/)} -> {<.A, A>.} = {{(/)}})
4039dmeqd 3313 . . . . . 6 |- (<.A, A>. = {(/)} -> dom {<.A, A>.} = dom {{(/)}})
4138, 40sylbi 199 . . . . 5 |- (-. A e. V -> dom {<.A, A>.} = dom {{(/)}})
42 snprc 2443 . . . . . 6 |- (-. A e. V <-> {A} = (/))
4342biimp 151 . . . . 5 |- (-. A e. V -> {A} = (/))
4435, 41, 433eqtr4a 1532 . . . 4 |- (-. A e. V -> dom {<.A, A>.} = {A})
4534, 44pm2.61i 126 . . 3 |- dom {<.A, A>.} = {A}
4621, 45syl6eq 1523 . 2 |- (-. B e. V -> dom {<.A, B>.} = {A})
4717, 46pm2.61i 126 1 |- dom {<.A, B>.} = {A}
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 146   /\ wa 223   = wceq 956   e. wcel 958  E.wex 980  {cab 1463  Vcvv 1811  (/)c0 2280  {csn 2409  <.cop 2411  dom cdm 3170
This theorem is referenced by:  dmsnsnsn 3329  op1sta 3448  rnsnop 3450  f1osn 3719  tfrlem10 3920  ablsn 8125  ringsn 8163  1alg 10654  1ded 10671  1cat 10692
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-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
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-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-br 2620  df-dm 3188
Copyright terms: Public domain