Theorem dmsnopss 6215

Description: The domain of a singleton of an ordered pair is a subset of the singleton of the first member (with no sethood assumptions on 𝐵). (Contributed by Mario Carneiro, 30-Apr-2015.)

Assertion

Ref	Expression
dmsnopss	⊢ dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴}

Proof of Theorem dmsnopss

Step	Hyp	Ref	Expression
1		dmsnopg 6214	. . 3 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = {𝐴})
2		eqimss 3966	. . 3 ⊢ (dom {⟨𝐴, 𝐵⟩} = {𝐴} → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
3	1, 2	syl 18	. 2 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
4		opprc2 4855	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → ⟨𝐴, 𝐵⟩ = ∅)
5	4	sneqd 4592	. . . . 5 ⊢ (¬ 𝐵 ∈ V → {⟨𝐴, 𝐵⟩} = {∅})
6	5	dmeqd 5886	. . . 4 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = dom {∅})
7		dmsn0 6210	. . . 4 ⊢ dom {∅} = ∅
8	6, 7	eqtrdi 2811	. . 3 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = ∅)
9		0ss 4349	. . 3 ⊢ ∅ ⊆ {𝐴}
10	8, 9	eqsstrdi 3952	. 2 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
11	3, 10	pm2.61i 184	1 ⊢ dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴}

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895  ∅c0 4278  {csn 4584  ⟨cop 4834  dom cdm 5650

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-dm 5660

This theorem is used by:  snopsuppss  8199  strle1  17341  setsres  17361  setscom  17363  setsid  17390  ex-res  31047  bj-fununsn1  38267  mapfzcons1  43821