Theorem dmsnopss 6220

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 6219	. . 3 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = {𝐴})
2		eqimss 3998	. . 3 ⊢ (dom {⟨𝐴, 𝐵⟩} = {𝐴} → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
3	1, 2	syl 18	. 2 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
4		opprc2 4868	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → ⟨𝐴, 𝐵⟩ = ∅)
5	4	sneqd 4606	. . . . 5 ⊢ (¬ 𝐵 ∈ V → {⟨𝐴, 𝐵⟩} = {∅})
6	5	dmeqd 5900	. . . 4 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = dom {∅})
7		dmsn0 6215	. . . 4 ⊢ dom {∅} = ∅
8	6, 7	eqtrdi 2817	. . 3 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = ∅)
9		0ss 4360	. . 3 ⊢ ∅ ⊆ {𝐴}
10	8, 9	eqsstrdi 3984	. 2 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
11	3, 10	pm2.61i 184	1 ⊢ dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴}

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2146  Vcvv 3458   ⊆ wss 3908  ∅c0 4289  {csn 4594  ⟨cop 4600  dom cdm 5666

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-dm 5676

This theorem is used by:  snopsuppss  8184  strle1  17243  setsres  17263  setscom  17265  setsid  17292  ex-res  30829  bj-fununsn1  37938  mapfzcons1  43489