Theorem brxrn 38355

Description: Characterize a ternary relation over a range Cartesian product. Together with xrnss3v 38353, this characterizes elementhood in a range cross. (Contributed by Peter Mazsa, 27-Jun-2021.)

Assertion

Ref	Expression
brxrn	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝐴𝑅𝐵 ∧ 𝐴𝑆𝐶)))

Proof of Theorem brxrn

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-xrn 38352	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
2	1	breqi 5153	. . 3 ⊢ (𝐴(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ 𝐴((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))⟨𝐵, 𝐶⟩)
3	2	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ 𝐴((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))⟨𝐵, 𝐶⟩))
4		brin 5199	. . 3 ⊢ (𝐴((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))⟨𝐵, 𝐶⟩ ↔ (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ∧ 𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩))
5	4	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))⟨𝐵, 𝐶⟩ ↔ (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ∧ 𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩)))
6		opex 5474	. . . . . 6 ⊢ ⟨𝐵, 𝐶⟩ ∈ V
7		brcog 5879	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ⟨𝐵, 𝐶⟩ ∈ V) → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩)))
8	6, 7	mpan2 691	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩)))
9	8	3ad2ant1 1132	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩)))
10		brcnvg 5892	. . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ ⟨𝐵, 𝐶⟩ ∈ V) → (𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥))
11	6, 10	mpan2 691	. . . . . . . 8 ⊢ (𝑥 ∈ V → (𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥))
12	11	elv 3482	. . . . . . 7 ⊢ (𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥)
13		brres 6006	. . . . . . . . . . 11 ⊢ (𝑥 ∈ V → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩1st 𝑥)))
14	13	elv 3482	. . . . . . . . . 10 ⊢ (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩1st 𝑥))
15		opelvvg 5729	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ⟨𝐵, 𝐶⟩ ∈ (V × V))
16	15	biantrurd 532	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩1st 𝑥 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩1st 𝑥)))
17	14, 16	bitr4id 290	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ ⟨𝐵, 𝐶⟩1st 𝑥))
18		br1steqg 8034	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩1st 𝑥 ↔ 𝑥 = 𝐵))
19	17, 18	bitrd 279	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ 𝑥 = 𝐵))
20	19	3adant1 1129	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ 𝑥 = 𝐵))
21	12, 20	bitrid 283	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ 𝑥 = 𝐵))
22	21	anbi1cd 635	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ 𝐴𝑅𝑥)))
23	22	exbidv 1918	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴𝑅𝑥)))
24		breq2 5151	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
25	24	ceqsexgv 3653	. . . . 5 ⊢ (𝐵 ∈ 𝑊 → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴𝑅𝑥) ↔ 𝐴𝑅𝐵))
26	25	3ad2ant2 1133	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴𝑅𝑥) ↔ 𝐴𝑅𝐵))
27	9, 23, 26	3bitrd 305	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ 𝐴𝑅𝐵))
28		brcog 5879	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ⟨𝐵, 𝐶⟩ ∈ V) → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ ∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩)))
29	6, 28	mpan2 691	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ ∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩)))
30	29	3ad2ant1 1132	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ ∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩)))
31		brcnvg 5892	. . . . . . . . 9 ⊢ ((𝑦 ∈ V ∧ ⟨𝐵, 𝐶⟩ ∈ V) → (𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦))
32	6, 31	mpan2 691	. . . . . . . 8 ⊢ (𝑦 ∈ V → (𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦))
33	32	elv 3482	. . . . . . 7 ⊢ (𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦)
34		brres 6006	. . . . . . . . . . 11 ⊢ (𝑦 ∈ V → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩2nd 𝑦)))
35	34	elv 3482	. . . . . . . . . 10 ⊢ (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩2nd 𝑦))
36	15	biantrurd 532	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩2nd 𝑦 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩2nd 𝑦)))
37	35, 36	bitr4id 290	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ ⟨𝐵, 𝐶⟩2nd 𝑦))
38		br2ndeqg 8035	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩2nd 𝑦 ↔ 𝑦 = 𝐶))
39	37, 38	bitrd 279	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ 𝑦 = 𝐶))
40	39	3adant1 1129	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ 𝑦 = 𝐶))
41	33, 40	bitrid 283	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ 𝑦 = 𝐶))
42	41	anbi1cd 635	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ (𝑦 = 𝐶 ∧ 𝐴𝑆𝑦)))
43	42	exbidv 1918	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴𝑆𝑦)))
44		breq2 5151	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐴𝑆𝑦 ↔ 𝐴𝑆𝐶))
45	44	ceqsexgv 3653	. . . . 5 ⊢ (𝐶 ∈ 𝑋 → (∃𝑦(𝑦 = 𝐶 ∧ 𝐴𝑆𝑦) ↔ 𝐴𝑆𝐶))
46	45	3ad2ant3 1134	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑦(𝑦 = 𝐶 ∧ 𝐴𝑆𝑦) ↔ 𝐴𝑆𝐶))
47	30, 43, 46	3bitrd 305	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ 𝐴𝑆𝐶))
48	27, 47	anbi12d 632	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ∧ 𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩) ↔ (𝐴𝑅𝐵 ∧ 𝐴𝑆𝐶)))
49	3, 5, 48	3bitrd 305	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ (𝐴𝑅𝐵 ∧ 𝐴𝑆𝐶)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1536  ∃wex 1775   ∈ wcel 2105  Vcvv 3477   ∩ cin 3961  ⟨cop 4636   class class class wbr 5147   × cxp 5686  ^◡ccnv 5687   ↾ cres 5690   ∘ ccom 5692  1^st c1st 8010  2^nd c2nd 8011   ⋉ cxrn 38160

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437  ax-un 7753

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-fo 6568  df-fv 6570  df-1st 8012  df-2nd 8013  df-xrn 38352

This theorem is referenced by:  brxrn2  38356  dfxrn2  38357  brin2  38390  br1cossxrnres  38429