Theorem dmsnopss 6208

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 6207	. . 3 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = {𝐴})
2		eqimss 3989	. . 3 ⊢ (dom {⟨𝐴, 𝐵⟩} = {𝐴} → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
3	1, 2	syl 18	. 2 ⊢ (𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
4		opprc2 4858	. . . . . 6 ⊢ (¬ 𝐵 ∈ V → ⟨𝐴, 𝐵⟩ = ∅)
5	4	sneqd 4596	. . . . 5 ⊢ (¬ 𝐵 ∈ V → {⟨𝐴, 𝐵⟩} = {∅})
6	5	dmeqd 5887	. . . 4 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = dom {∅})
7		dmsn0 6203	. . . 4 ⊢ dom {∅} = ∅
8	6, 7	eqtrdi 2812	. . 3 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} = ∅)
9		0ss 4350	. . 3 ⊢ ∅ ⊆ {𝐴}
10	8, 9	eqsstrdi 3975	. 2 ⊢ (¬ 𝐵 ∈ V → dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴})
11	3, 10	pm2.61i 184	1 ⊢ dom {⟨𝐴, 𝐵⟩} ⊆ {𝐴}

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  {csn 4584  ⟨cop 4590  dom cdm 5651

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 2733  ax-sep 5249  ax-pr 5391

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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-dm 5661

This theorem is used by:  snopsuppss  8180  strle1  17316  setsres  17336  setscom  17338  setsid  17365  ex-res  31024  bj-fununsn1  38142  mapfzcons1  43681