Theorem dfco2a 6242

Description: Generalization of dfco2 6241, where 𝐶 can have any value between dom 𝐴 ∩ ran 𝐵 and V. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
dfco2a	⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝐴 ∘ 𝐵) = ∪ 𝑥 ∈ 𝐶 ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem dfco2a

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

Step	Hyp	Ref	Expression
1		dfco2 6241	. 2 ⊢ (𝐴 ∘ 𝐵) = ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))
2		vex 3454	. . . . . . . . . . . . . . 15 ⊢ 𝑧 ∈ V
3	2	eliniseg 6090	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ V → (𝑧 ∈ (◡𝐵 “ {𝑥}) ↔ 𝑧𝐵𝑥))
4	3	elv 3455	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ (◡𝐵 “ {𝑥}) ↔ 𝑧𝐵𝑥)
5		vex 3454	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
6	2, 5	brelrn 5926	. . . . . . . . . . . . 13 ⊢ (𝑧𝐵𝑥 → 𝑥 ∈ ran 𝐵)
7	4, 6	sylbi 220	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (◡𝐵 “ {𝑥}) → 𝑥 ∈ ran 𝐵)
8		vex 3454	. . . . . . . . . . . . . 14 ⊢ 𝑤 ∈ V
9	5, 8	elimasn 6086	. . . . . . . . . . . . 13 ⊢ (𝑤 ∈ (𝐴 “ {𝑥}) ↔ ⟨𝑥, 𝑤⟩ ∈ 𝐴)
10	5, 8	opeldm 5891	. . . . . . . . . . . . 13 ⊢ (⟨𝑥, 𝑤⟩ ∈ 𝐴 → 𝑥 ∈ dom 𝐴)
11	9, 10	sylbi 220	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ (𝐴 “ {𝑥}) → 𝑥 ∈ dom 𝐴)
12	7, 11	anim12ci 626	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ (◡𝐵 “ {𝑥}) ∧ 𝑤 ∈ (𝐴 “ {𝑥})) → (𝑥 ∈ dom 𝐴 ∧ 𝑥 ∈ ran 𝐵))
13	12	adantl 487	. . . . . . . . . 10 ⊢ ((𝑦 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ (◡𝐵 “ {𝑥}) ∧ 𝑤 ∈ (𝐴 “ {𝑥}))) → (𝑥 ∈ dom 𝐴 ∧ 𝑥 ∈ ran 𝐵))
14	13	exlimivv 1965	. . . . . . . . 9 ⊢ (∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ (◡𝐵 “ {𝑥}) ∧ 𝑤 ∈ (𝐴 “ {𝑥}))) → (𝑥 ∈ dom 𝐴 ∧ 𝑥 ∈ ran 𝐵))
15		elxp 5678	. . . . . . . . 9 ⊢ (𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑧∃𝑤(𝑦 = ⟨𝑧, 𝑤⟩ ∧ (𝑧 ∈ (◡𝐵 “ {𝑥}) ∧ 𝑤 ∈ (𝐴 “ {𝑥}))))
16		elin 3915	. . . . . . . . 9 ⊢ (𝑥 ∈ (dom 𝐴 ∩ ran 𝐵) ↔ (𝑥 ∈ dom 𝐴 ∧ 𝑥 ∈ ran 𝐵))
17	14, 15, 16	3imtr4i 295	. . . . . . . 8 ⊢ (𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) → 𝑥 ∈ (dom 𝐴 ∩ ran 𝐵))
18		ssel 3925	. . . . . . . 8 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝑥 ∈ (dom 𝐴 ∩ ran 𝐵) → 𝑥 ∈ 𝐶))
19	17, 18	syl5 35	. . . . . . 7 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) → 𝑥 ∈ 𝐶))
20	19	pm4.71rd 572	. . . . . 6 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))))
21	20	exbidv 1954	. . . . 5 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (∃𝑥 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥(𝑥 ∈ 𝐶 ∧ 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))))
22		rexv 3477	. . . . 5 ⊢ (∃𝑥 ∈ V 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
23		df-rex 3087	. . . . 5 ⊢ (∃𝑥 ∈ 𝐶 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥(𝑥 ∈ 𝐶 ∧ 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))))
24	21, 22, 23	3bitr4g 317	. . . 4 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (∃𝑥 ∈ V 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥 ∈ 𝐶 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))))
25		eliun 4955	. . . 4 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥 ∈ V 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
26		eliun 4955	. . . 4 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐶 ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥 ∈ 𝐶 𝑦 ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
27	24, 25, 26	3bitr4g 317	. . 3 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝑦 ∈ ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐶 ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))))
28	27	eqrdv 2758	. 2 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) = ∪ 𝑥 ∈ 𝐶 ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
29	1, 28	eqtrid 2807	1 ⊢ ((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝐴 ∘ 𝐵) = ∪ 𝑥 ∈ 𝐶 ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3086  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  {csn 4584  ⟨cop 4590  ∪ ciun 4951   class class class wbr 5103   × cxp 5653  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658   ∘ ccom 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-iun 4953  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668

This theorem is used by:  fparlem3  8111  fparlem4  8112