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

Theorem dmsnop 2547
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 1350 . . . . . . . . 9 xV
2 visset 1350 . . . . . . . . 9 yV
31, 2opthg 1899 . . . . . . . 8 (BV → (⟨x, y⟩ = ⟨A, B⟩ ↔ (x = Ay = B)))
4 opex 1893 . . . . . . . . 9 x, y⟩ ∈ V
54elsnc 1826 . . . . . . . 8 (⟨x, y⟩ ∈ {⟨A, B⟩} ↔ ⟨x, y⟩ = ⟨A, B⟩)
63, 5syl5bb 410 . . . . . . 7 (BV → (⟨x, y⟩ ∈ {⟨A, B⟩} ↔ (x = Ay = B)))
76biexdv 936 . . . . . 6 (BV → (∃yx, y⟩ ∈ {⟨A, B⟩} ↔ ∃y(x = Ay = B)))
8 19.42v 966 . . . . . 6 (∃y(x = Ay = B) ↔ (x = A ∧ ∃y y = B))
97, 8syl6bb 414 . . . . 5 (BV → (∃yx, y⟩ ∈ {⟨A, B⟩} ↔ (x = A ∧ ∃y y = B)))
10 isset 1351 . . . . . 6 (BV ↔ ∃y y = B)
11 iba 486 . . . . . 6 (∃y y = B → (x = A ↔ (x = A ∧ ∃y y = B)))
1210, 11sylbi 174 . . . . 5 (BV → (x = A ↔ (x = A ∧ ∃y y = B)))
139, 12bitr4d 409 . . . 4 (BV → (∃yx, y⟩ ∈ {⟨A, B⟩} ↔ x = A))
1413biabdv 1183 . . 3 (BV → {x∣∃yx, y⟩ ∈ {⟨A, B⟩}} = {xx = A})
15 dfdm3 2522 . . 3 dom {⟨A, B⟩} = {x∣∃yx, y⟩ ∈ {⟨A, B⟩}}
16 df-sn 1811 . . 3 {A} = {xx = A}
1714 15, 163eqtr4g 1147 . 2 (BV → dom {⟨A, B⟩} = {A})
18 opprc2 1907 . . . 4 BV → ⟨A, B⟩ = ⟨A, A⟩)
19 sneq 1816 . . . 4 (⟨A, B⟩ = ⟨A, A⟩ → {⟨A, B⟩} = {⟨A, A⟩})
20 dmeq 2531 . . . 4 ({⟨A, B⟩} = {⟨A, A⟩} → dom {⟨A, B⟩} = dom {⟨A, A⟩})
2118, 19, 203syl 21 . . 3 BV → dom {⟨A, B⟩} = dom {⟨A, A⟩})
221, 2opthg 1899 . . . . . . . . . 10 (AV → (⟨x, y⟩ = ⟨A, A⟩ ↔ (x = Ay = A)))
234elsnc 1826 . . . . . . . . . 10 (⟨x, y⟩ ∈ {⟨A, A⟩} ↔ ⟨x, y⟩ = ⟨A, A⟩)
2422, 23syl5bb 410 . . . . . . . . 9 (AV → (⟨x, y⟩ ∈ {⟨A, A⟩} ↔ (x = Ay = A)))
2524biexdv 936 . . . . . . . 8 (AV → (∃yx, y⟩ ∈ {⟨A, A⟩} ↔ ∃y(x = Ay = A)))
26 19.42v 966 . . . . . . . 8 (∃y(x = Ay = A) ↔ (x = A ∧ ∃y y = A))
2725, 26syl6bb 414 . . . . . . 7 (AV → (∃yx, y⟩ ∈ {⟨A, A⟩} ↔ (x = A ∧ ∃y y = A)))
28 isset 1351 . . . . . . . 8 (AV ↔ ∃y y = A)
29 iba 486 . . . . . . . 8 (∃y y = A → (x = A ↔ (x = A ∧ ∃y y = A)))
3028, 29sylbi 174 . . . . . . 7 (AV → (x = A ↔ (x = A ∧ ∃y y = A)))
3127, 30bitr4d 409 . . . . . 6 (AV → (∃yx, y⟩ ∈ {⟨A, A⟩} ↔ x = A))
3231biabdv 1183 . . . . 5 (AV → {x∣∃yx, y⟩ ∈ {⟨A, A⟩}} = {xx = A})
33 dfdm3 2522 . . . . 5 dom {⟨A, A⟩} = {x∣∃yx, y⟩ ∈ {⟨A, A⟩}}
3432, 33, 163eqtr4g 1147 . . . 4 (AV → dom {⟨A, A⟩} = {A})
35 anidm 331 . . . . . . . 8 ((¬ AV ∧ ¬ AV) ↔ ¬ AV)
36 opprc3 1908 . . . . . . . 8 ((¬ AV ∧ ¬ AV) ↔ ⟨A, A⟩ = {∅})
3735, 36bitr3 153 . . . . . . 7 AV ↔ ⟨A, A⟩ = {∅})
38 sneq 1816 . . . . . . . 8 (⟨A, A⟩ = {∅} → {⟨A, A⟩} = {{∅}})
3938dmeqd 2533 . . . . . . 7 (⟨A, A⟩ = {∅} → dom {⟨A, A⟩} = dom {{∅}})
4037, 39sylbi 174 . . . . . 6 AV → dom {⟨A, A⟩} = dom {{∅}})
41 dmsnsn0 2544 . . . . . 6 dom {{∅}} = ∅
4240, 41syl6eq 1140 . . . . 5 AV → dom {⟨A, A⟩} = ∅)
43 snprc 1838 . . . . . 6 AV ↔ {A} = ∅)
4443biimp 133 . . . . 5 AV → {A} = ∅)
4542, 44eqtr4d 1131 . . . 4 AV → dom {⟨A, A⟩} = {A})
4634, 45pm2.61i 110 . . 3 dom {⟨A, A⟩} = {A}
4721, 46syl6eq 1140 . 2 BV → dom {⟨A, B⟩} = {A})
4817, 47pm2.61i 110 1 dom {⟨A, B⟩} = {A}
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   ↔ wb 127   ∧ wa 196  ∃wex 678  {cab 1090   = wceq 1091   ∈ wcel 1092  Vcvv 1348  ∅c0 1707  {csn 1808  ⟨cop 1810  dom cdm 2410
This theorem is referenced by:  dmsnsnsn 2548  op1sta 2635  rnsnop 2637  f1osn 2827  tfrlem10 2958  fac0 4871
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-dm 2428
metamath.org