NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  dmcosseq GIF version

Theorem dmcosseq 4974
Description: Domain of a composition. (The proof was shortened by Andrew Salmon, 27-Aug-2011.) (Contributed by set.mm contributors, 28-May-1998.) (Revised by set.mm contributors, 27-Aug-2011.)
Assertion
Ref Expression
dmcosseq ⊢ (ran B ⊆ dom A → dom (A ∘ B) = dom B)

Proof of Theorem dmcosseq
Dummy variables x y z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmcoss 4972 . . 3 ⊢ dom (A ∘ B) ⊆ dom B
21a1i 10 . 2 ⊢ (ran B ⊆ dom A → dom (A ∘ B) ⊆ dom B)
3 brelrn 4961 . . . . . . . . . 10 ⊢ (xBy → y ∈ ran B)
4 ssel 3268 . . . . . . . . . 10 ⊢ (ran B ⊆ dom A → (y ∈ ran B → y ∈ dom A))
53, 4syl5 28 . . . . . . . . 9 ⊢ (ran B ⊆ dom A → (xBy → y ∈ dom A))
6 eldm 4899 . . . . . . . . 9 ⊢ (y ∈ dom A ↔ ∃z yAz)
75, 6syl6ib 217 . . . . . . . 8 ⊢ (ran B ⊆ dom A → (xBy → ∃z yAz))
87ancld 536 . . . . . . 7 ⊢ (ran B ⊆ dom A → (xBy → (xBy ∧ ∃z yAz)))
9 19.42v 1905 . . . . . . 7 ⊢ (∃z(xBy ∧ yAz) ↔ (xBy ∧ ∃z yAz))
108, 9syl6ibr 218 . . . . . 6 ⊢ (ran B ⊆ dom A → (xBy → ∃z(xBy ∧ yAz)))
1110eximdv 1622 . . . . 5 ⊢ (ran B ⊆ dom A → (∃y xBy → ∃y∃z(xBy ∧ yAz)))
12 brco 4884 . . . . . . 7 ⊢ (x(A ∘ B)z ↔ ∃y(xBy ∧ yAz))
1312exbii 1582 . . . . . 6 ⊢ (∃z x(A ∘ B)z ↔ ∃z∃y(xBy ∧ yAz))
14 excom 1741 . . . . . 6 ⊢ (∃z∃y(xBy ∧ yAz) ↔ ∃y∃z(xBy ∧ yAz))
1513, 14bitri 240 . . . . 5 ⊢ (∃z x(A ∘ B)z ↔ ∃y∃z(xBy ∧ yAz))
1611, 15syl6ibr 218 . . . 4 ⊢ (ran B ⊆ dom A → (∃y xBy → ∃z x(A ∘ B)z))
17 eldm 4899 . . . 4 ⊢ (x ∈ dom B ↔ ∃y xBy)
18 eldm 4899 . . . 4 ⊢ (x ∈ dom (A ∘ B) ↔ ∃z x(A ∘ B)z)
1916, 17, 183imtr4g 261 . . 3 ⊢ (ran B ⊆ dom A → (x ∈ dom B → x ∈ dom (A ∘ B)))
2019ssrdv 3279 . 2 ⊢ (ran B ⊆ dom A → dom B ⊆ dom (A ∘ B))
212, 20eqssd 3290 1 ⊢ (ran B ⊆ dom A → dom (A ∘ B) = dom B)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 358  ∃wex 1541   = wceq 1642   ∈ wcel 1710   ⊆ wss 3258   class class class wbr 4640   ∘ ccom 4722  dom cdm 4773  ran crn 4774
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088
This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-co 4727  df-ima 4728  df-cnv 4786  df-rn 4787  df-dm 4788
This theorem is used by:  dmcoeq  4975  fnco  5192  sbthlem3  6206
  Copyright terms: Public domain W3C validator