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 32432
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 32429 . . . . . . 7 (𝑅𝑆) ⊆ (V × (V × V))
21brel 5336 . . . . . 6 (𝐴(𝑅𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V)))
32simprd 489 . . . . 5 (𝐴(𝑅𝑆)𝐵𝐵 ∈ (V × V))
4 elvv 5345 . . . . 5 (𝐵 ∈ (V × V) ↔ ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
53, 4sylib 209 . . . 4 (𝐴(𝑅𝑆)𝐵 → ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
65pm4.71ri 556 . . 3 (𝐴(𝑅𝑆)𝐵 ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
7 19.41vv 2045 . . 3 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
86, 7bitr4i 269 . 2 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
9 breq2 4813 . . . 4 (𝐵 = ⟨𝑥, 𝑦⟩ → (𝐴(𝑅𝑆)𝐵𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
109pm5.32i 570 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
11102exbii 1944 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
12 brtxp2.1 . . . . . 6 𝐴 ∈ V
13 vex 3353 . . . . . 6 𝑥 ∈ V
14 vex 3353 . . . . . 6 𝑦 ∈ V
1512, 13, 14brtxp 32431 . . . . 5 (𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥𝐴𝑆𝑦))
1615anbi2i 616 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
17 3anass 1116 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
1816, 17bitr4i 269 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
19182exbii 1944 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
208, 11, 193bitri 288 1 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 197  wa 384  w3a 1107   = wceq 1652  wex 1874  wcel 2155  Vcvv 3350  cop 4340   class class class wbr 4809   × cxp 5275  ctxp 32381
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-sep 4941  ax-nul 4949  ax-pow 5001  ax-pr 5062  ax-un 7147
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-mo 2565  df-eu 2582  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ral 3060  df-rex 3061  df-rab 3064  df-v 3352  df-sbc 3597  df-dif 3735  df-un 3737  df-in 3739  df-ss 3746  df-nul 4080  df-if 4244  df-sn 4335  df-pr 4337  df-op 4341  df-uni 4595  df-br 4810  df-opab 4872  df-mpt 4889  df-id 5185  df-xp 5283  df-rel 5284  df-cnv 5285  df-co 5286  df-dm 5287  df-rn 5288  df-res 5289  df-iota 6031  df-fun 6070  df-fn 6071  df-f 6072  df-fo 6074  df-fv 6076  df-1st 7366  df-2nd 7367  df-txp 32405
This theorem is referenced by:  brsuccf  32492  brrestrict  32500
  Copyright terms: Public domain W3C validator