Theorem dfco2 5879

Description: Alternate definition of a class composition, using only one bound variable. (Contributed by NM, 19-Dec-2008.)

Assertion

Ref	Expression
dfco2	⊢ (𝐴 ∘ 𝐵) = ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dfco2

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

Step	Hyp	Ref	Expression
1		relco 5878	. 2 ⊢ Rel (𝐴 ∘ 𝐵)
2		reliun 5478	. . 3 ⊢ (Rel ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∀𝑥 ∈ V Rel ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
3		relxp 5364	. . . 4 ⊢ Rel ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))
4	3	a1i 11	. . 3 ⊢ (𝑥 ∈ V → Rel ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
5	2, 4	mprgbir 3136	. 2 ⊢ Rel ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))
6		vex 3417	. . . 4 ⊢ 𝑦 ∈ V
7		vex 3417	. . . 4 ⊢ 𝑧 ∈ V
8		opelco2g 5526	. . . 4 ⊢ ((𝑦 ∈ V ∧ 𝑧 ∈ V) → (⟨𝑦, 𝑧⟩ ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴)))
9	6, 7, 8	mp2an 683	. . 3 ⊢ (⟨𝑦, 𝑧⟩ ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
10		eliun 4746	. . . 4 ⊢ (⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥 ∈ V ⟨𝑦, 𝑧⟩ ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
11		rexv 3437	. . . 4 ⊢ (∃𝑥 ∈ V ⟨𝑦, 𝑧⟩ ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥⟨𝑦, 𝑧⟩ ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
12		opelxp 5382	. . . . . 6 ⊢ (⟨𝑦, 𝑧⟩ ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ (𝑦 ∈ (◡𝐵 “ {𝑥}) ∧ 𝑧 ∈ (𝐴 “ {𝑥})))
13		vex 3417	. . . . . . . . 9 ⊢ 𝑥 ∈ V
14	13, 6	elimasn 5735	. . . . . . . 8 ⊢ (𝑦 ∈ (◡𝐵 “ {𝑥}) ↔ ⟨𝑥, 𝑦⟩ ∈ ◡𝐵)
15	13, 6	opelcnv 5540	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ ◡𝐵 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐵)
16	14, 15	bitri 267	. . . . . . 7 ⊢ (𝑦 ∈ (◡𝐵 “ {𝑥}) ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐵)
17	13, 7	elimasn 5735	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 “ {𝑥}) ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐴)
18	16, 17	anbi12i 620	. . . . . 6 ⊢ ((𝑦 ∈ (◡𝐵 “ {𝑥}) ∧ 𝑧 ∈ (𝐴 “ {𝑥})) ↔ (⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
19	12, 18	bitri 267	. . . . 5 ⊢ (⟨𝑦, 𝑧⟩ ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ (⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
20	19	exbii 1947	. . . 4 ⊢ (∃𝑥⟨𝑦, 𝑧⟩ ∈ ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
21	10, 11, 20	3bitrri 290	. . 3 ⊢ (∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) ↔ ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
22	9, 21	bitri 267	. 2 ⊢ (⟨𝑦, 𝑧⟩ ∈ (𝐴 ∘ 𝐵) ↔ ⟨𝑦, 𝑧⟩ ∈ ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
23	1, 5, 22	eqrelriiv 5452	1 ⊢ (𝐴 ∘ 𝐵) = ∪ 𝑥 ∈ V ((◡𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))

Syntax hints:   ↔ wb 198   ∧ wa 386   = wceq 1656  ∃wex 1878   ∈ wcel 2164  ∃wrex 3118  Vcvv 3414  {csn 4399  ⟨cop 4405  ∪ ciun 4742   × cxp 5344  ^◡ccnv 5345   “ cima 5349   ∘ ccom 5350  Rel wrel 5351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-sep 5007  ax-nul 5015  ax-pr 5129

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4147  df-if 4309  df-sn 4400  df-pr 4402  df-op 4406  df-iun 4744  df-br 4876  df-opab 4938  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-res 5358  df-ima 5359

This theorem is referenced by:  dfco2a  5880