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 36512
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 5439 . 2 𝐴, 𝐵⟩ ∈ V
2 brcart.3 . 2 𝐶 ∈ V
3 df-cart 36445 . 2 Cart = (((V × V) × V) ∖ ran ((V ⊗ E ) △ (pprod( E , E ) ⊗ V)))
4 brcart.1 . . . 4 𝐴 ∈ V
5 brcart.2 . . . 4 𝐵 ∈ V
64, 5opelvv 5695 . . 3 𝐴, 𝐵⟩ ∈ (V × V)
7 brxp 5704 . . 3 (⟨𝐴, 𝐵⟩((V × V) × V)𝐶 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ 𝐶 ∈ V))
86, 2, 7mpbir2an 724 . 2 𝐴, 𝐵⟩((V × V) × V)𝐶
9 3anass 1111 . . . . 5 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 E 𝐴𝑧 E 𝐵)))
104epeli 5557 . . . . . . 7 (𝑦 E 𝐴𝑦𝐴)
115epeli 5557 . . . . . . 7 (𝑧 E 𝐵𝑧𝐵)
1210, 11anbi12i 640 . . . . . 6 ((𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑦𝐴𝑧𝐵))
1312anbi2i 635 . . . . 5 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 E 𝐴𝑧 E 𝐵)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
149, 13bitri 278 . . . 4 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
15142exbii 1882 . . 3 (∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
16 vex 3454 . . . 4 𝑥 ∈ V
1716, 4, 5brpprod3b 36467 . . 3 (𝑥pprod( E , E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑦 E 𝐴𝑧 E 𝐵))
18 elxp 5678 . . 3 (𝑥 ∈ (𝐴 × 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
1915, 17, 183bitr4ri 307 . 2 (𝑥 ∈ (𝐴 × 𝐵) ↔ 𝑥pprod( E , E )⟨𝐴, 𝐵⟩)
201, 2, 3, 8, 19brtxpsd3 36476 1 (⟨𝐴, 𝐵⟩Cart𝐶𝐶 = (𝐴 × 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401  w3a 1103   = wceq 1570  wex 1812  wcel 2145  Vcvv 3450  cop 4590   class class class wbr 5103   E cep 5554   × cxp 5653  pprodcpprod 36411  Cartccart 36421
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-symdif 4199  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-1st 7987  df-2nd 7988  df-txp 36434  df-pprod 36435  df-cart 36445
This theorem is used by:  brimg  36517  brrestrict  36531
  Copyright terms: Public domain W3C validator