Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brcup Structured version   Visualization version   GIF version

Theorem brcup 32171
Description: Binary relation form of the Cup function. (Contributed by Scott Fenton, 14-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Hypotheses
Ref Expression
brcup.1 𝐴 ∈ V
brcup.2 𝐵 ∈ V
brcup.3 𝐶 ∈ V
Assertion
Ref Expression
brcup (⟨𝐴, 𝐵⟩Cup𝐶𝐶 = (𝐴𝐵))

Proof of Theorem brcup
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 4962 . 2 𝐴, 𝐵⟩ ∈ V
2 brcup.3 . 2 𝐶 ∈ V
3 df-cup 32101 . 2 Cup = (((V × V) × V) ∖ ran ((V ⊗ E ) △ (((1st ∘ E ) ∪ (2nd ∘ E )) ⊗ V)))
4 brcup.1 . . . 4 𝐴 ∈ V
5 brcup.2 . . . 4 𝐵 ∈ V
64, 5opelvv 5200 . . 3 𝐴, 𝐵⟩ ∈ (V × V)
7 brxp 5181 . . 3 (⟨𝐴, 𝐵⟩((V × V) × V)𝐶 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ 𝐶 ∈ V))
86, 2, 7mpbir2an 975 . 2 𝐴, 𝐵⟩((V × V) × V)𝐶
9 epel 5061 . . . . . . 7 (𝑥 E 𝑦𝑥𝑦)
10 vex 3234 . . . . . . . . 9 𝑦 ∈ V
1110, 1brcnv 5337 . . . . . . . 8 (𝑦1st𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩1st 𝑦)
124, 5br1steq 31796 . . . . . . . 8 (⟨𝐴, 𝐵⟩1st 𝑦𝑦 = 𝐴)
1311, 12bitri 264 . . . . . . 7 (𝑦1st𝐴, 𝐵⟩ ↔ 𝑦 = 𝐴)
149, 13anbi12ci 734 . . . . . 6 ((𝑥 E 𝑦𝑦1st𝐴, 𝐵⟩) ↔ (𝑦 = 𝐴𝑥𝑦))
1514exbii 1814 . . . . 5 (∃𝑦(𝑥 E 𝑦𝑦1st𝐴, 𝐵⟩) ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
16 vex 3234 . . . . . 6 𝑥 ∈ V
1716, 1brco 5325 . . . . 5 (𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦(𝑥 E 𝑦𝑦1st𝐴, 𝐵⟩))
184clel3 3373 . . . . 5 (𝑥𝐴 ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
1915, 17, 183bitr4i 292 . . . 4 (𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ↔ 𝑥𝐴)
2010, 1brcnv 5337 . . . . . . . 8 (𝑦2nd𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩2nd 𝑦)
214, 5br2ndeq 31797 . . . . . . . 8 (⟨𝐴, 𝐵⟩2nd 𝑦𝑦 = 𝐵)
2220, 21bitri 264 . . . . . . 7 (𝑦2nd𝐴, 𝐵⟩ ↔ 𝑦 = 𝐵)
239, 22anbi12ci 734 . . . . . 6 ((𝑥 E 𝑦𝑦2nd𝐴, 𝐵⟩) ↔ (𝑦 = 𝐵𝑥𝑦))
2423exbii 1814 . . . . 5 (∃𝑦(𝑥 E 𝑦𝑦2nd𝐴, 𝐵⟩) ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
2516, 1brco 5325 . . . . 5 (𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦(𝑥 E 𝑦𝑦2nd𝐴, 𝐵⟩))
265clel3 3373 . . . . 5 (𝑥𝐵 ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
2724, 25, 263bitr4i 292 . . . 4 (𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩ ↔ 𝑥𝐵)
2819, 27orbi12i 542 . . 3 ((𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ∨ 𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩) ↔ (𝑥𝐴𝑥𝐵))
29 brun 4736 . . 3 (𝑥((1st ∘ E ) ∪ (2nd ∘ E ))⟨𝐴, 𝐵⟩ ↔ (𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ∨ 𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩))
30 elun 3786 . . 3 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
3128, 29, 303bitr4ri 293 . 2 (𝑥 ∈ (𝐴𝐵) ↔ 𝑥((1st ∘ E ) ∪ (2nd ∘ E ))⟨𝐴, 𝐵⟩)
321, 2, 3, 8, 31brtxpsd3 32128 1 (⟨𝐴, 𝐵⟩Cup𝐶𝐶 = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wo 382  wa 383   = wceq 1523  wex 1744  wcel 2030  Vcvv 3231  cun 3605  cop 4216   class class class wbr 4685   E cep 5057   × cxp 5141  ccnv 5142  ccom 5147  1st c1st 7208  2nd c2nd 7209  Cupccup 32078
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-symdif 3877  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-eprel 5058  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fo 5932  df-fv 5934  df-1st 7210  df-2nd 7211  df-txp 32086  df-cup 32101
This theorem is referenced by:  brsuccf  32173
  Copyright terms: Public domain W3C validator