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

Theorem brtxp2 31683
Description: The binary relationship over a tail cross when the second argument is not an ordered pair. (Contributed by Scott Fenton, 14-Apr-2014.) (Revised by Mario Carneiro, 3-May-2015.)
Hypothesis
Ref Expression
brtxp2.1 𝐴 ∈ V
Assertion
Ref Expression
brtxp2 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦

Proof of Theorem brtxp2
StepHypRef Expression
1 txpss3v 31680 . . . . . . 7 (𝑅𝑆) ⊆ (V × (V × V))
21brel 5138 . . . . . 6 (𝐴(𝑅𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V)))
32simprd 479 . . . . 5 (𝐴(𝑅𝑆)𝐵𝐵 ∈ (V × V))
4 elvv 5148 . . . . 5 (𝐵 ∈ (V × V) ↔ ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
53, 4sylib 208 . . . 4 (𝐴(𝑅𝑆)𝐵 → ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
65pm4.71ri 664 . . 3 (𝐴(𝑅𝑆)𝐵 ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
7 19.41vv 1912 . . 3 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
86, 7bitr4i 267 . 2 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
9 breq2 4627 . . . 4 (𝐵 = ⟨𝑥, 𝑦⟩ → (𝐴(𝑅𝑆)𝐵𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
109pm5.32i 668 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
11102exbii 1772 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
12 brtxp2.1 . . . . . 6 𝐴 ∈ V
13 vex 3193 . . . . . 6 𝑥 ∈ V
14 vex 3193 . . . . . 6 𝑦 ∈ V
1512, 13, 14brtxp 31682 . . . . 5 (𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥𝐴𝑆𝑦))
1615anbi2i 729 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
17 3anass 1040 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
1816, 17bitr4i 267 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
19182exbii 1772 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
208, 11, 193bitri 286 1 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384  w3a 1036   = wceq 1480  wex 1701  wcel 1987  Vcvv 3190  cop 4161   class class class wbr 4623   × cxp 5082  ctxp 31631
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-fo 5863  df-fv 5865  df-1st 7128  df-2nd 7129  df-txp 31655
This theorem is referenced by:  brsuccf  31743  brrestrict  31751
  Copyright terms: Public domain W3C validator