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

Theorem brcart 35896
Description: Binary relation form of the cartesian product operator. (Contributed by Scott Fenton, 11-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Hypotheses
Ref Expression
brcart.1 𝐴 ∈ V
brcart.2 𝐵 ∈ V
brcart.3 𝐶 ∈ V
Assertion
Ref Expression
brcart (⟨𝐴, 𝐵⟩Cart𝐶𝐶 = (𝐴 × 𝐵))

Proof of Theorem brcart
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 5484 . 2 𝐴, 𝐵⟩ ∈ V
2 brcart.3 . 2 𝐶 ∈ V
3 df-cart 35829 . 2 Cart = (((V × V) × V) ∖ ran ((V ⊗ E ) △ (pprod( E , E ) ⊗ V)))
4 brcart.1 . . . 4 𝐴 ∈ V
5 brcart.2 . . . 4 𝐵 ∈ V
64, 5opelvv 5740 . . 3 𝐴, 𝐵⟩ ∈ (V × V)
7 brxp 5749 . . 3 (⟨𝐴, 𝐵⟩((V × V) × V)𝐶 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ 𝐶 ∈ V))
86, 2, 7mpbir2an 710 . 2 𝐴, 𝐵⟩((V × V) × V)𝐶
9 3anass 1095 . . . . 5 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 E 𝐴𝑧 E 𝐵)))
104epeli 5601 . . . . . . 7 (𝑦 E 𝐴𝑦𝐴)
115epeli 5601 . . . . . . 7 (𝑧 E 𝐵𝑧𝐵)
1210, 11anbi12i 627 . . . . . 6 ((𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑦𝐴𝑧𝐵))
1312anbi2i 622 . . . . 5 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 E 𝐴𝑧 E 𝐵)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
149, 13bitri 275 . . . 4 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
15142exbii 1847 . . 3 (∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
16 vex 3492 . . . 4 𝑥 ∈ V
1716, 4, 5brpprod3b 35851 . . 3 (𝑥pprod( E , E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵))
18 elxp 5723 . . 3 (𝑥 ∈ (𝐴 × 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
1915, 17, 183bitr4ri 304 . 2 (𝑥 ∈ (𝐴 × 𝐵) ↔ 𝑥pprod( E , E )⟨𝐴, 𝐵⟩)
201, 2, 3, 8, 19brtxpsd3 35860 1 (⟨𝐴, 𝐵⟩Cart𝐶𝐶 = (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1087   = wceq 1537  wex 1777  wcel 2108  Vcvv 3488  cop 4654   class class class wbr 5166   E cep 5598   × cxp 5698  pprodcpprod 35795  Cartccart 35805
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-symdif 4272  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-eprel 5599  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fo 6579  df-fv 6581  df-1st 8030  df-2nd 8031  df-txp 35818  df-pprod 35819  df-cart 35829
This theorem is referenced by:  brimg  35901  brrestrict  35913
  Copyright terms: Public domain W3C validator