Theorem dmss 4978

Description: Subset theorem for domain. (Contributed by NM, 11-Aug-1994.)

Assertion

Ref	Expression
dmss	⊢ (𝐴 ⊆ 𝐵 → dom 𝐴 ⊆ dom 𝐵)

Proof of Theorem dmss

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 3242	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
2	1	eximdv 1933	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 → ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵))
3		vex 2824	. . . 4 ⊢ 𝑥 ∈ V
4	3	eldm2 4977	. . 3 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
5	3	eldm2 4977	. . 3 ⊢ (𝑥 ∈ dom 𝐵 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵)
6	2, 4, 5	3imtr4g 205	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ dom 𝐴 → 𝑥 ∈ dom 𝐵))
7	6	ssrdv 3254	1 ⊢ (𝐴 ⊆ 𝐵 → dom 𝐴 ⊆ dom 𝐵)

Syntax hints:   → wi 4  ∃wex 1545   ∈ wcel 2209   ⊆ wss 3220  ⟨cop 3711  dom cdm 4772

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3714  df-pr 3715  df-op 3717  df-br 4129  df-dm 4782

This theorem is referenced by:  dmeq  4979  dmv  4995  rnss  5010  dmiin  5026  dmxpss2  5218  ssxpbm  5221  ssxp1  5222  cocnvres  5310  relrelss  5312  funssxp  5555  fvun1  5766  fndmdif  5808  fneqeql2  5812  funsssuppss  6492  tposss  6511  smores  6557  smores2  6559  tfrlemibfn  6593  tfrlemiubacc  6595  tfr1onlembfn  6609  tfr1onlemubacc  6611  tfr1onlemres  6614  tfrcllembfn  6622  tfrcllemubacc  6624  tfrcllemres  6627  frecuzrdgtcl  10832  frecuzrdgdomlem  10837  hashdmprop2dom  11279  ennnfonelemex  13288  strleund  13440  strleun  13441  imasaddfnlemg  13618  dvbssntrcntop  15768  subgreldmiedg  16493