Theorem brxrn 38356

Description: Characterize a ternary relation over a range Cartesian product. Together with xrnss3v 38354, 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 38353	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
2	1	breqi 5113	. . 3 ⊢ (𝐴(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ 𝐴((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))⟨𝐵, 𝐶⟩)
3	2	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(𝑅 ⋉ 𝑆)⟨𝐵, 𝐶⟩ ↔ 𝐴((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))⟨𝐵, 𝐶⟩))
4		brin 5159	. . 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 5424	. . . . . 6 ⊢ ⟨𝐵, 𝐶⟩ ∈ V
7		brcog 5830	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ⟨𝐵, 𝐶⟩ ∈ V) → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩)))
8	6, 7	mpan2 691	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩)))
9	8	3ad2ant1 1133	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩)))
10		brcnvg 5843	. . . . . . . . 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 3452	. . . . . . 7 ⊢ (𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥)
13		brres 5957	. . . . . . . . . . 11 ⊢ (𝑥 ∈ V → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩1st 𝑥)))
14	13	elv 3452	. . . . . . . . . 10 ⊢ (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩1st 𝑥))
15		opelvvg 5679	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ⟨𝐵, 𝐶⟩ ∈ (V × V))
16	15	biantrurd 532	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩1st 𝑥 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩1st 𝑥)))
17	14, 16	bitr4id 290	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ ⟨𝐵, 𝐶⟩1st 𝑥))
18		br1steqg 7990	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩1st 𝑥 ↔ 𝑥 = 𝐵))
19	17, 18	bitrd 279	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ 𝑥 = 𝐵))
20	19	3adant1 1130	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(1st ↾ (V × V))𝑥 ↔ 𝑥 = 𝐵))
21	12, 20	bitrid 283	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ 𝑥 = 𝐵))
22	21	anbi1cd 635	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ 𝐴𝑅𝑥)))
23	22	exbidv 1921	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥(𝐴𝑅𝑥 ∧ 𝑥◡(1st ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴𝑅𝑥)))
24		breq2 5111	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
25	24	ceqsexgv 3620	. . . . 5 ⊢ (𝐵 ∈ 𝑊 → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴𝑅𝑥) ↔ 𝐴𝑅𝐵))
26	25	3ad2ant2 1134	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴𝑅𝑥) ↔ 𝐴𝑅𝐵))
27	9, 23, 26	3bitrd 305	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(1st ↾ (V × V)) ∘ 𝑅)⟨𝐵, 𝐶⟩ ↔ 𝐴𝑅𝐵))
28		brcog 5830	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ⟨𝐵, 𝐶⟩ ∈ V) → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ ∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩)))
29	6, 28	mpan2 691	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ ∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩)))
30	29	3ad2ant1 1133	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴(◡(2nd ↾ (V × V)) ∘ 𝑆)⟨𝐵, 𝐶⟩ ↔ ∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩)))
31		brcnvg 5843	. . . . . . . . 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 3452	. . . . . . 7 ⊢ (𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ ⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦)
34		brres 5957	. . . . . . . . . . 11 ⊢ (𝑦 ∈ V → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ (⟨𝐵, 𝐶⟩ ∈ (V × V) ∧ ⟨𝐵, 𝐶⟩2nd 𝑦)))
35	34	elv 3452	. . . . . . . . . 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 7991	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩2nd 𝑦 ↔ 𝑦 = 𝐶))
39	37, 38	bitrd 279	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ 𝑦 = 𝐶))
40	39	3adant1 1130	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐵, 𝐶⟩(2nd ↾ (V × V))𝑦 ↔ 𝑦 = 𝐶))
41	33, 40	bitrid 283	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩ ↔ 𝑦 = 𝐶))
42	41	anbi1cd 635	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ (𝑦 = 𝐶 ∧ 𝐴𝑆𝑦)))
43	42	exbidv 1921	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑦(𝐴𝑆𝑦 ∧ 𝑦◡(2nd ↾ (V × V))⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴𝑆𝑦)))
44		breq2 5111	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐴𝑆𝑦 ↔ 𝐴𝑆𝐶))
45	44	ceqsexgv 3620	. . . . 5 ⊢ (𝐶 ∈ 𝑋 → (∃𝑦(𝑦 = 𝐶 ∧ 𝐴𝑆𝑦) ↔ 𝐴𝑆𝐶))
46	45	3ad2ant3 1135	. . . 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 1540  ∃wex 1779   ∈ wcel 2109  Vcvv 3447   ∩ cin 3913  ⟨cop 4595   class class class wbr 5107   × cxp 5636  ^◡ccnv 5637   ↾ cres 5640   ∘ ccom 5642  1^st c1st 7966  2^nd c2nd 7967   ⋉ cxrn 38168

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517  df-fv 6519  df-1st 7968  df-2nd 7969  df-xrn 38353

This theorem is referenced by:  brxrn2  38357  dfxrn2  38358  brxrncnvep  38359  brin2  38400  br1cossxrnres  38439