Theorem dmcoss 5968

Description: Domain of a composition. Theorem 21 of [Suppes] p. 63. (Contributed by NM, 19-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
dmcoss	⊢ dom (𝐴 ∘ 𝐵) ⊆ dom 𝐵

Proof of Theorem dmcoss

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

Step	Hyp	Ref	Expression
1		nfe1 2140	. . . 4 ⊢ Ⅎ𝑦∃𝑦 𝑥𝐵𝑦
2		exsimpl 1864	. . . . 5 ⊢ (∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) → ∃𝑧 𝑥𝐵𝑧)
3		vex 3473	. . . . . 6 ⊢ 𝑥 ∈ V
4		vex 3473	. . . . . 6 ⊢ 𝑦 ∈ V
5	3, 4	opelco 5868	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦))
6		breq2 5146	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑥𝐵𝑦 ↔ 𝑥𝐵𝑧))
7	6	cbvexvw 2033	. . . . 5 ⊢ (∃𝑦 𝑥𝐵𝑦 ↔ ∃𝑧 𝑥𝐵𝑧)
8	2, 5, 7	3imtr4i 292	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵) → ∃𝑦 𝑥𝐵𝑦)
9	1, 8	exlimi 2203	. . 3 ⊢ (∃𝑦⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵) → ∃𝑦 𝑥𝐵𝑦)
10	3	eldm2 5898	. . 3 ⊢ (𝑥 ∈ dom (𝐴 ∘ 𝐵) ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵))
11	3	eldm 5897	. . 3 ⊢ (𝑥 ∈ dom 𝐵 ↔ ∃𝑦 𝑥𝐵𝑦)
12	9, 10, 11	3imtr4i 292	. 2 ⊢ (𝑥 ∈ dom (𝐴 ∘ 𝐵) → 𝑥 ∈ dom 𝐵)
13	12	ssriv 3982	1 ⊢ dom (𝐴 ∘ 𝐵) ⊆ dom 𝐵

Syntax hints:   ∧ wa 395  ∃wex 1774   ∈ wcel 2099   ⊆ wss 3944  ⟨cop 4630   class class class wbr 5142  dom cdm 5672   ∘ ccom 5676

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5143  df-opab 5205  df-co 5681  df-dm 5682

This theorem is referenced by:  rncoss  5969  dmcosseq  5970  cossxp  6270  fvco4i  6993  cofunexg  7946  fin23lem30  10357  wunco  10748  relexpnndm  15012  mvdco  19391  f1omvdconj  19392  znleval  21475  ofco2  22340  tngtopn  24554  xppreima  32415  cycpmrn  32842  relexp0a  43069  dmtrclfvRP  43083