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 32113
Description: The binary relation 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 32110 . . . . . . 7 (𝑅𝑆) ⊆ (V × (V × V))
21brel 5202 . . . . . 6 (𝐴(𝑅𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V)))
32simprd 478 . . . . 5 (𝐴(𝑅𝑆)𝐵𝐵 ∈ (V × V))
4 elvv 5211 . . . . 5 (𝐵 ∈ (V × V) ↔ ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
53, 4sylib 208 . . . 4 (𝐴(𝑅𝑆)𝐵 → ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
65pm4.71ri 666 . . 3 (𝐴(𝑅𝑆)𝐵 ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
7 19.41vv 1918 . . 3 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
86, 7bitr4i 267 . 2 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
9 breq2 4689 . . . 4 (𝐵 = ⟨𝑥, 𝑦⟩ → (𝐴(𝑅𝑆)𝐵𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
109pm5.32i 670 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
11102exbii 1815 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
12 brtxp2.1 . . . . . 6 𝐴 ∈ V
13 vex 3234 . . . . . 6 𝑥 ∈ V
14 vex 3234 . . . . . 6 𝑦 ∈ V
1512, 13, 14brtxp 32112 . . . . 5 (𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥𝐴𝑆𝑦))
1615anbi2i 730 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
17 3anass 1059 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
1816, 17bitr4i 267 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
19182exbii 1815 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
208, 11, 193bitri 286 1 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 383  w3a 1054   = wceq 1523  wex 1744  wcel 2030  Vcvv 3231  cop 4216   class class class wbr 4685   × cxp 5141  ctxp 32062
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fo 5932  df-fv 5934  df-1st 7210  df-2nd 7211  df-txp 32086
This theorem is referenced by:  brsuccf  32173  brrestrict  32181
  Copyright terms: Public domain W3C validator