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 36321
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 5446 . 2 𝐴, 𝐵⟩ ∈ V
2 brcart.3 . 2 𝐶 ∈ V
3 df-cart 36254 . 2 Cart = (((V × V) × V) ∖ ran ((V ⊗ E ) △ (pprod( E , E ) ⊗ V)))
4 brcart.1 . . . 4 𝐴 ∈ V
5 brcart.2 . . . 4 𝐵 ∈ V
64, 5opelvv 5702 . . 3 𝐴, 𝐵⟩ ∈ (V × V)
7 brxp 5711 . . 3 (⟨𝐴, 𝐵⟩((V × V) × V)𝐶 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ 𝐶 ∈ V))
86, 2, 7mpbir2an 723 . 2 𝐴, 𝐵⟩((V × V) × V)𝐶
9 3anass 1109 . . . . 5 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 E 𝐴𝑧 E 𝐵)))
104epeli 5564 . . . . . . 7 (𝑦 E 𝐴𝑦𝐴)
115epeli 5564 . . . . . . 7 (𝑧 E 𝐵𝑧𝐵)
1210, 11anbi12i 639 . . . . . 6 ((𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑦𝐴𝑧𝐵))
1312anbi2i 634 . . . . 5 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 E 𝐴𝑧 E 𝐵)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
149, 13bitri 278 . . . 4 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
15142exbii 1876 . . 3 (∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
16 vex 3467 . . . 4 𝑥 ∈ V
1716, 4, 5brpprod3b 36276 . . 3 (𝑥pprod( E , E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵))
18 elxp 5685 . . 3 (𝑥 ∈ (𝐴 × 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
1915, 17, 183bitr4ri 307 . 2 (𝑥 ∈ (𝐴 × 𝐵) ↔ 𝑥pprod( E , E )⟨𝐴, 𝐵⟩)
201, 2, 3, 8, 19brtxpsd3 36285 1 (⟨𝐴, 𝐵⟩Cart𝐶𝐶 = (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  w3a 1101   = wceq 1567  wex 1806  wcel 2149  Vcvv 3463  cop 4600   class class class wbr 5113   E cep 5561   × cxp 5660  pprodcpprod 36220  Cartccart 36230
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-symdif 4214  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-eprel 5562  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-1st 7986  df-2nd 7987  df-txp 36243  df-pprod 36244  df-cart 36254
This theorem is referenced by:  brimg  36326  brrestrict  36340
  Copyright terms: Public domain W3C validator