Theorem dmss 4960

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 3236	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
2	1	eximdv 1929	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 → ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵))
3		vex 2818	. . . 4 ⊢ 𝑥 ∈ V
4	3	eldm2 4959	. . 3 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
5	3	eldm2 4959	. . 3 ⊢ (𝑥 ∈ dom 𝐵 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵)
6	2, 4, 5	3imtr4g 205	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ dom 𝐴 → 𝑥 ∈ dom 𝐵))
7	6	ssrdv 3248	1 ⊢ (𝐴 ⊆ 𝐵 → dom 𝐴 ⊆ dom 𝐵)

Syntax hints:   → wi 4  ∃wex 1541   ∈ wcel 2205   ⊆ wss 3214  ⟨cop 3697  dom cdm 4754

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-dm 4764

This theorem is referenced by:  dmeq  4961  dmv  4977  rnss  4992  dmiin  5008  dmxpss2  5200  ssxpbm  5203  ssxp1  5204  cocnvres  5292  relrelss  5294  funssxp  5537  fvun1  5748  fndmdif  5788  fneqeql2  5792  funsssuppss  6471  tposss  6490  smores  6536  smores2  6538  tfrlemibfn  6572  tfrlemiubacc  6574  tfr1onlembfn  6588  tfr1onlemubacc  6590  tfr1onlemres  6593  tfrcllembfn  6601  tfrcllemubacc  6603  tfrcllemres  6606  frecuzrdgtcl  10798  frecuzrdgdomlem  10803  hashdmprop2dom  11241  ennnfonelemex  13249  strleund  13400  strleun  13401  imasaddfnlemg  13611  dvbssntrcntop  15661  subgreldmiedg  16376