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

Theorem brtxp2 33350
 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 33347 . . . . . . 7 (𝑅𝑆) ⊆ (V × (V × V))
21brel 5593 . . . . . 6 (𝐴(𝑅𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V)))
32simprd 498 . . . . 5 (𝐴(𝑅𝑆)𝐵𝐵 ∈ (V × V))
4 elvv 5602 . . . . 5 (𝐵 ∈ (V × V) ↔ ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
53, 4sylib 220 . . . 4 (𝐴(𝑅𝑆)𝐵 → ∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
65pm4.71ri 563 . . 3 (𝐴(𝑅𝑆)𝐵 ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
7 19.41vv 1951 . . 3 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (∃𝑥𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
86, 7bitr4i 280 . 2 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵))
9 breq2 5046 . . . 4 (𝐵 = ⟨𝑥, 𝑦⟩ → (𝐴(𝑅𝑆)𝐵𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
109pm5.32i 577 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
11102exbii 1849 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)𝐵) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩))
12 brtxp2.1 . . . . . 6 𝐴 ∈ V
13 vex 3476 . . . . . 6 𝑥 ∈ V
14 vex 3476 . . . . . 6 𝑦 ∈ V
1512, 13, 14brtxp 33349 . . . . 5 (𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥𝐴𝑆𝑦))
1615anbi2i 624 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
17 3anass 1091 . . . 4 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥𝐴𝑆𝑦)))
1816, 17bitr4i 280 . . 3 ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
19182exbii 1849 . 2 (∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅𝑆)⟨𝑥, 𝑦⟩) ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
208, 11, 193bitri 299 1 (𝐴(𝑅𝑆)𝐵 ↔ ∃𝑥𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥𝐴𝑆𝑦))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537  ∃wex 1780   ∈ wcel 2114  Vcvv 3473  ⟨cop 4549   class class class wbr 5042   × cxp 5529   ⊗ ctxp 33299 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ral 3130  df-rex 3131  df-rab 3134  df-v 3475  df-sbc 3753  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4270  df-if 4444  df-sn 4544  df-pr 4546  df-op 4550  df-uni 4815  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5436  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-fo 6337  df-fv 6339  df-1st 7667  df-2nd 7668  df-txp 33323 This theorem is referenced by:  brsuccf  33410  brrestrict  33418
 Copyright terms: Public domain W3C validator