Theorem dmss 4928

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 3219	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
2	1	eximdv 1926	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 → ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵))
3		vex 2803	. . . 4 ⊢ 𝑥 ∈ V
4	3	eldm2 4927	. . 3 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
5	3	eldm2 4927	. . 3 ⊢ (𝑥 ∈ dom 𝐵 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵)
6	2, 4, 5	3imtr4g 205	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ dom 𝐴 → 𝑥 ∈ dom 𝐵))
7	6	ssrdv 3231	1 ⊢ (𝐴 ⊆ 𝐵 → dom 𝐴 ⊆ dom 𝐵)

Syntax hints:   → wi 4  ∃wex 1538   ∈ wcel 2200   ⊆ wss 3198  ⟨cop 3670  dom cdm 4723

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-dm 4733

This theorem is referenced by:  dmeq  4929  dmv  4945  rnss  4960  dmiin  4976  dmxpss2  5167  ssxpbm  5170  ssxp1  5171  cocnvres  5259  relrelss  5261  funssxp  5501  fvun1  5708  fndmdif  5748  fneqeql2  5752  tposss  6407  smores  6453  smores2  6455  tfrlemibfn  6489  tfrlemiubacc  6491  tfr1onlembfn  6505  tfr1onlemubacc  6507  tfr1onlemres  6510  tfrcllembfn  6518  tfrcllemubacc  6520  tfrcllemres  6523  frecuzrdgtcl  10667  frecuzrdgdomlem  10672  hashdmprop2dom  11101  ennnfonelemex  13028  strleund  13179  strleun  13180  imasaddfnlemg  13390  dvbssntrcntop  15401