Theorem dmsnopss 6229

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 6228	. . 3 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = {𝐴})
2		eqimss 3971	. . 3 ⊢ (dom {⟨𝐴, 𝐵⟩} = {𝐴} → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
3	1, 2	syl 18	. 2 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
4		opprc2 4859	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → ⟨𝐴, 𝐵⟩ = ∅)
5	4	sneqd 4596	. . . . 5 ⊢ (¬ 𝐵 ∈ V → {⟨𝐴, 𝐵⟩} = {∅})
6	5	dmeqd 5895	. . . 4 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = dom {∅})
7		dmsn0 6224	. . . 4 ⊢ dom {∅} = ∅
8	6, 7	eqtrdi 2814	. . 3 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = ∅)
9		0ss 4353	. . 3 ⊢ ∅ ⊆ {𝐴}
10	8, 9	eqsstrdi 3957	. 2 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
11	3, 10	pm2.61i 184	1 ⊢ dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴}

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  {csn 4588  ⟨cop 4838  dom cdm 5656

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-xp 5662  df-dm 5666

This theorem is used by:  snopsuppss  8227  strle1  17368  setsres  17388  setscom  17390  setsid  17417  ex-res  31075  bj-fununsn1  38379  mapfzcons1  43932