Theorem s1dmALT 14564

Description: Alternate version of s1dm 14563, having a shorter proof, but requiring that 𝐴 is a set. (Contributed by AV, 9-Jan-2020.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
s1dmALT	⊢ (𝐴 ∈ 𝑆 → dom ⟨“𝐴”⟩ = {0})

Proof of Theorem s1dmALT

Step	Hyp	Ref	Expression
1		s1val 14553	. . 3 ⊢ (𝐴 ∈ 𝑆 → ⟨“𝐴”⟩ = {⟨0, 𝐴⟩})
2	1	dmeqd 5848	. 2 ⊢ (𝐴 ∈ 𝑆 → dom ⟨“𝐴”⟩ = dom {⟨0, 𝐴⟩})
3		dmsnopg 6165	. 2 ⊢ (𝐴 ∈ 𝑆 → dom {⟨0, 𝐴⟩} = {0})
4	2, 3	eqtrd 2774	1 ⊢ (𝐴 ∈ 𝑆 → dom ⟨“𝐴”⟩ = {0})

Syntax hints:   → wi 4   = wceq 1547   ∈ wcel 2119  {csn 4556  ⟨cop 4562  dom cdm 5619  0cc0 11030  ⟨“cs1 14550

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-12 2189  ax-ext 2711  ax-sep 5219  ax-pr 5363

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4263  df-if 4456  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-br 5074  df-opab 5136  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-iota 6442  df-fun 6488  df-fv 6494  df-s1 14551

This theorem is referenced by: (None)