Theorem dmcoss 5052

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 1549	. . . 4 ⊢ Ⅎ𝑦∃𝑦 𝑥𝐵𝑦
2		exsimpl 1670	. . . . 5 ⊢ (∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) → ∃𝑧 𝑥𝐵𝑧)
3		vex 2824	. . . . . 6 ⊢ 𝑥 ∈ V
4		vex 2824	. . . . . 6 ⊢ 𝑦 ∈ V
5	3, 4	opelco 4952	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦))
6		breq2 4134	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑥𝐵𝑦 ↔ 𝑥𝐵𝑧))
7	6	cbvexv 1974	. . . . 5 ⊢ (∃𝑦 𝑥𝐵𝑦 ↔ ∃𝑧 𝑥𝐵𝑧)
8	2, 5, 7	3imtr4i 201	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵) → ∃𝑦 𝑥𝐵𝑦)
9	1, 8	exlimi 1647	. . 3 ⊢ (∃𝑦⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵) → ∃𝑦 𝑥𝐵𝑦)
10	3	eldm2 4979	. . 3 ⊢ (𝑥 ∈ dom (𝐴 ∘ 𝐵) ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ (𝐴 ∘ 𝐵))
11	3	eldm 4978	. . 3 ⊢ (𝑥 ∈ dom 𝐵 ↔ ∃𝑦 𝑥𝐵𝑦)
12	9, 10, 11	3imtr4i 201	. 2 ⊢ (𝑥 ∈ dom (𝐴 ∘ 𝐵) → 𝑥 ∈ dom 𝐵)
13	12	ssriv 3252	1 ⊢ dom (𝐴 ∘ 𝐵) ⊆ dom 𝐵

This proof depends on syntax axioms:   ∧ wa 104  ∃wex 1545   ∈ wcel 2209   ⊆ wss 3220  ⟨cop 3712   class class class wbr 4130  dom cdm 4774   ∘ ccom 4778

This proof depends on 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-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-co 4783  df-dm 4784

This theorem is used by:  rncoss  5053  dmcosseq  5054  cossxp  5310  funco  5417  cofunexg  6338  casefun  7425  djufun  7444  ctssdccl  7451  znleval  14990