Theorem brtxp2 36459

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

Step	Hyp	Ref	Expression
1		txpss3v 36456	. . . . . . 7 ⊢ (𝑅 ⊗ 𝑆) ⊆ (V × (V × V))
2	1	brel 5720	. . . . . 6 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ (V × V)))
3	2	simprd 501	. . . . 5 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 → 𝐵 ∈ (V × V))
4		elvv 5730	. . . . 5 ⊢ (𝐵 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
5	3, 4	sylib 221	. . . 4 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 → ∃𝑥∃𝑦 𝐵 = ⟨𝑥, 𝑦⟩)
6	5	pm4.71ri 570	. . 3 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ (∃𝑥∃𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵))
7		19.41vv 1983	. . 3 ⊢ (∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵) ↔ (∃𝑥∃𝑦 𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵))
8	6, 7	bitr4i 281	. 2 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵))
9		breq2 5107	. . . 4 ⊢ (𝐵 = ⟨𝑥, 𝑦⟩ → (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ 𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩))
10	9	pm5.32i 585	. . 3 ⊢ ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩))
11	10	2exbii 1882	. 2 ⊢ (∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)𝐵) ↔ ∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩))
12		brtxp2.1	. . . . . 6 ⊢ 𝐴 ∈ V
13		vex 3454	. . . . . 6 ⊢ 𝑥 ∈ V
14		vex 3454	. . . . . 6 ⊢ 𝑦 ∈ V
15	12, 13, 14	brtxp 36458	. . . . 5 ⊢ (𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))
16	15	anbi2i 635	. . . 4 ⊢ ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)))
17		3anass 1111	. . . 4 ⊢ ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)))
18	16, 17	bitr4i 281	. . 3 ⊢ ((𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩) ↔ (𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))
19	18	2exbii 1882	. 2 ⊢ (∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴(𝑅 ⊗ 𝑆)⟨𝑥, 𝑦⟩) ↔ ∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))
20	8, 11, 19	3bitri 300	1 ⊢ (𝐴(𝑅 ⊗ 𝑆)𝐵 ↔ ∃𝑥∃𝑦(𝐵 = ⟨𝑥, 𝑦⟩ ∧ 𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦))

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   × cxp 5653   ⊗ ctxp 36408

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-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-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 36432

This theorem is used by:  lemsuccf  36519  brrestrict  36529