ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfco2 GIF version

Theorem dfco2 5103
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.
StepHypRef Expression
1 relco 5102 . 2 Rel (𝐴𝐵)
2 reliun 4725 . . 3 (Rel 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∀𝑥 ∈ V Rel ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
3 relxp 4713 . . . 4 Rel ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))
43a1i 9 . . 3 (𝑥 ∈ V → Rel ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
52, 4mprgbir 2524 . 2 Rel 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))
6 vex 2729 . . . 4 𝑦 ∈ V
7 vex 2729 . . . 4 𝑧 ∈ V
8 opelco2g 4772 . . . 4 ((𝑦 ∈ V ∧ 𝑧 ∈ V) → (⟨𝑦, 𝑧⟩ ∈ (𝐴𝐵) ↔ ∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴)))
96, 7, 8mp2an 423 . . 3 (⟨𝑦, 𝑧⟩ ∈ (𝐴𝐵) ↔ ∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
10 eliun 3870 . . . 4 (⟨𝑦, 𝑧⟩ ∈ 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥 ∈ V ⟨𝑦, 𝑧⟩ ∈ ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
11 rexv 2744 . . . 4 (∃𝑥 ∈ V ⟨𝑦, 𝑧⟩ ∈ ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥𝑦, 𝑧⟩ ∈ ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
12 opelxp 4634 . . . . . 6 (⟨𝑦, 𝑧⟩ ∈ ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ (𝑦 ∈ (𝐵 “ {𝑥}) ∧ 𝑧 ∈ (𝐴 “ {𝑥})))
13 vex 2729 . . . . . . . . 9 𝑥 ∈ V
1413, 6elimasn 4971 . . . . . . . 8 (𝑦 ∈ (𝐵 “ {𝑥}) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵)
1513, 6opelcnv 4786 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝐵 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐵)
1614, 15bitri 183 . . . . . . 7 (𝑦 ∈ (𝐵 “ {𝑥}) ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐵)
1713, 7elimasn 4971 . . . . . . 7 (𝑧 ∈ (𝐴 “ {𝑥}) ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐴)
1816, 17anbi12i 456 . . . . . 6 ((𝑦 ∈ (𝐵 “ {𝑥}) ∧ 𝑧 ∈ (𝐴 “ {𝑥})) ↔ (⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
1912, 18bitri 183 . . . . 5 (⟨𝑦, 𝑧⟩ ∈ ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ (⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
2019exbii 1593 . . . 4 (∃𝑥𝑦, 𝑧⟩ ∈ ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})) ↔ ∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴))
2110, 11, 203bitrri 206 . . 3 (∃𝑥(⟨𝑦, 𝑥⟩ ∈ 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐴) ↔ ⟨𝑦, 𝑧⟩ ∈ 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
229, 21bitri 183 . 2 (⟨𝑦, 𝑧⟩ ∈ (𝐴𝐵) ↔ ⟨𝑦, 𝑧⟩ ∈ 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))
231, 5, 22eqrelriiv 4698 1 (𝐴𝐵) = 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104   = wceq 1343  wex 1480  wcel 2136  wrex 2445  Vcvv 2726  {csn 3576  cop 3579   ciun 3866   × cxp 4602  ccnv 4603  cima 4607  ccom 4608  Rel wrel 4609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-iun 3868  df-br 3983  df-opab 4044  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617
This theorem is referenced by:  dfco2a  5104
  Copyright terms: Public domain W3C validator