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

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

Proof of Theorem brcap
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 5469 . 2 𝐴, 𝐵⟩ ∈ V
2 brcap.3 . 2 𝐶 ∈ V
3 df-cap 35871 . 2 Cap = (((V × V) × V) ∖ ran ((V ⊗ E ) △ (((1st ∘ E ) ∩ (2nd ∘ E )) ⊗ V)))
4 brcap.1 . . . 4 𝐴 ∈ V
5 brcap.2 . . . 4 𝐵 ∈ V
64, 5opelvv 5725 . . 3 𝐴, 𝐵⟩ ∈ (V × V)
7 brxp 5734 . . 3 (⟨𝐴, 𝐵⟩((V × V) × V)𝐶 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ 𝐶 ∈ V))
86, 2, 7mpbir2an 711 . 2 𝐴, 𝐵⟩((V × V) × V)𝐶
9 epel 5587 . . . . . . 7 (𝑥 E 𝑦𝑥𝑦)
10 vex 3484 . . . . . . . . 9 𝑦 ∈ V
1110, 1brcnv 5893 . . . . . . . 8 (𝑦1st𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩1st 𝑦)
124, 5br1steq 35771 . . . . . . . 8 (⟨𝐴, 𝐵⟩1st 𝑦𝑦 = 𝐴)
1311, 12bitri 275 . . . . . . 7 (𝑦1st𝐴, 𝐵⟩ ↔ 𝑦 = 𝐴)
149, 13anbi12ci 629 . . . . . 6 ((𝑥 E 𝑦𝑦1st𝐴, 𝐵⟩) ↔ (𝑦 = 𝐴𝑥𝑦))
1514exbii 1848 . . . . 5 (∃𝑦(𝑥 E 𝑦𝑦1st𝐴, 𝐵⟩) ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
16 vex 3484 . . . . . 6 𝑥 ∈ V
1716, 1brco 5881 . . . . 5 (𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦(𝑥 E 𝑦𝑦1st𝐴, 𝐵⟩))
184clel3 3662 . . . . 5 (𝑥𝐴 ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
1915, 17, 183bitr4i 303 . . . 4 (𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ↔ 𝑥𝐴)
2010, 1brcnv 5893 . . . . . . . 8 (𝑦2nd𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩2nd 𝑦)
214, 5br2ndeq 35772 . . . . . . . 8 (⟨𝐴, 𝐵⟩2nd 𝑦𝑦 = 𝐵)
2220, 21bitri 275 . . . . . . 7 (𝑦2nd𝐴, 𝐵⟩ ↔ 𝑦 = 𝐵)
239, 22anbi12ci 629 . . . . . 6 ((𝑥 E 𝑦𝑦2nd𝐴, 𝐵⟩) ↔ (𝑦 = 𝐵𝑥𝑦))
2423exbii 1848 . . . . 5 (∃𝑦(𝑥 E 𝑦𝑦2nd𝐴, 𝐵⟩) ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
2516, 1brco 5881 . . . . 5 (𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦(𝑥 E 𝑦𝑦2nd𝐴, 𝐵⟩))
265clel3 3662 . . . . 5 (𝑥𝐵 ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
2724, 25, 263bitr4i 303 . . . 4 (𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩ ↔ 𝑥𝐵)
2819, 27anbi12i 628 . . 3 ((𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ∧ 𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩) ↔ (𝑥𝐴𝑥𝐵))
29 brin 5195 . . 3 (𝑥((1st ∘ E ) ∩ (2nd ∘ E ))⟨𝐴, 𝐵⟩ ↔ (𝑥(1st ∘ E )⟨𝐴, 𝐵⟩ ∧ 𝑥(2nd ∘ E )⟨𝐴, 𝐵⟩))
30 elin 3967 . . 3 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
3128, 29, 303bitr4ri 304 . 2 (𝑥 ∈ (𝐴𝐵) ↔ 𝑥((1st ∘ E ) ∩ (2nd ∘ E ))⟨𝐴, 𝐵⟩)
321, 2, 3, 8, 31brtxpsd3 35897 1 (⟨𝐴, 𝐵⟩Cap𝐶𝐶 = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wex 1779  wcel 2108  Vcvv 3480  cin 3950  cop 4632   class class class wbr 5143   E cep 5583   × cxp 5683  ccnv 5684  ccom 5689  1st c1st 8012  2nd c2nd 8013  Capccap 35848
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-symdif 4253  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-eprel 5584  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-fo 6567  df-fv 6569  df-1st 8014  df-2nd 8015  df-txp 35855  df-cap 35871
This theorem is referenced by:  brrestrict  35950
  Copyright terms: Public domain W3C validator