Theorem dmsnopss 6214

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 6213	. . 3 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = {𝐴})
2		eqimss 3992	. . 3 ⊢ (dom {⟨𝐴, 𝐵⟩} = {𝐴} → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
3	1, 2	syl 18	. 2 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
4		opprc2 4861	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → ⟨𝐴, 𝐵⟩ = ∅)
5	4	sneqd 4599	. . . . 5 ⊢ (¬ 𝐵 ∈ V → {⟨𝐴, 𝐵⟩} = {∅})
6	5	dmeqd 5893	. . . 4 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = dom {∅})
7		dmsn0 6209	. . . 4 ⊢ dom {∅} = ∅
8	6, 7	eqtrdi 2813	. . 3 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = ∅)
9		0ss 4353	. . 3 ⊢ ∅ ⊆ {𝐴}
10	8, 9	eqsstrdi 3978	. 2 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
11	3, 10	pm2.61i 184	1 ⊢ dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴}

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902  ∅c0 4282  {csn 4587  ⟨cop 4593  dom cdm 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-dm 5669

This theorem is used by:  snopsuppss  8181  strle1  17256  setsres  17276  setscom  17278  setsid  17305  ex-res  30929  bj-fununsn1  38013  mapfzcons1  43570