Theorem brcap 36151

Description: Binary relation form of the Cap function. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Hypotheses

Ref	Expression
brcap.1	⊢ 𝐴 ∈ V
brcap.2	⊢ 𝐵 ∈ V
brcap.3	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
brcap	⊢ (⟨𝐴, 𝐵⟩Cap𝐶 ↔ 𝐶 = (𝐴 ∩ 𝐵))

Proof of Theorem brcap

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

Step	Hyp	Ref	Expression
1		opex 5419	. 2 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
2		brcap.3	. 2 ⊢ 𝐶 ∈ V
3		df-cap 36081	. 2 ⊢ Cap = (((V × V) × V) ∖ ran ((V ⊗ E ) △ (((◡1st ∘ E ) ∩ (◡2nd ∘ E )) ⊗ V)))
4		brcap.1	. . . 4 ⊢ 𝐴 ∈ V
5		brcap.2	. . . 4 ⊢ 𝐵 ∈ V
6	4, 5	opelvv 5672	. . 3 ⊢ ⟨𝐴, 𝐵⟩ ∈ (V × V)
7		brxp 5681	. . 3 ⊢ (⟨𝐴, 𝐵⟩((V × V) × V)𝐶 ↔ (⟨𝐴, 𝐵⟩ ∈ (V × V) ∧ 𝐶 ∈ V))
8	6, 2, 7	mpbir2an 712	. 2 ⊢ ⟨𝐴, 𝐵⟩((V × V) × V)𝐶
9		epel 5535	. . . . . . 7 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦)
10		vex 3446	. . . . . . . . 9 ⊢ 𝑦 ∈ V
11	10, 1	brcnv 5839	. . . . . . . 8 ⊢ (𝑦◡1st ⟨𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩1st 𝑦)
12	4, 5	br1steq 35984	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩1st 𝑦 ↔ 𝑦 = 𝐴)
13	11, 12	bitri 275	. . . . . . 7 ⊢ (𝑦◡1st ⟨𝐴, 𝐵⟩ ↔ 𝑦 = 𝐴)
14	9, 13	anbi12ci 630	. . . . . 6 ⊢ ((𝑥 E 𝑦 ∧ 𝑦◡1st ⟨𝐴, 𝐵⟩) ↔ (𝑦 = 𝐴 ∧ 𝑥 ∈ 𝑦))
15	14	exbii 1850	. . . . 5 ⊢ (∃𝑦(𝑥 E 𝑦 ∧ 𝑦◡1st ⟨𝐴, 𝐵⟩) ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑥 ∈ 𝑦))
16		vex 3446	. . . . . 6 ⊢ 𝑥 ∈ V
17	16, 1	brco 5827	. . . . 5 ⊢ (𝑥(◡1st ∘ E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦(𝑥 E 𝑦 ∧ 𝑦◡1st ⟨𝐴, 𝐵⟩))
18	4	clel3 3618	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑥 ∈ 𝑦))
19	15, 17, 18	3bitr4i 303	. . . 4 ⊢ (𝑥(◡1st ∘ E )⟨𝐴, 𝐵⟩ ↔ 𝑥 ∈ 𝐴)
20	10, 1	brcnv 5839	. . . . . . . 8 ⊢ (𝑦◡2nd ⟨𝐴, 𝐵⟩ ↔ ⟨𝐴, 𝐵⟩2nd 𝑦)
21	4, 5	br2ndeq 35985	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩2nd 𝑦 ↔ 𝑦 = 𝐵)
22	20, 21	bitri 275	. . . . . . 7 ⊢ (𝑦◡2nd ⟨𝐴, 𝐵⟩ ↔ 𝑦 = 𝐵)
23	9, 22	anbi12ci 630	. . . . . 6 ⊢ ((𝑥 E 𝑦 ∧ 𝑦◡2nd ⟨𝐴, 𝐵⟩) ↔ (𝑦 = 𝐵 ∧ 𝑥 ∈ 𝑦))
24	23	exbii 1850	. . . . 5 ⊢ (∃𝑦(𝑥 E 𝑦 ∧ 𝑦◡2nd ⟨𝐴, 𝐵⟩) ↔ ∃𝑦(𝑦 = 𝐵 ∧ 𝑥 ∈ 𝑦))
25	16, 1	brco 5827	. . . . 5 ⊢ (𝑥(◡2nd ∘ E )⟨𝐴, 𝐵⟩ ↔ ∃𝑦(𝑥 E 𝑦 ∧ 𝑦◡2nd ⟨𝐴, 𝐵⟩))
26	5	clel3 3618	. . . . 5 ⊢ (𝑥 ∈ 𝐵 ↔ ∃𝑦(𝑦 = 𝐵 ∧ 𝑥 ∈ 𝑦))
27	24, 25, 26	3bitr4i 303	. . . 4 ⊢ (𝑥(◡2nd ∘ E )⟨𝐴, 𝐵⟩ ↔ 𝑥 ∈ 𝐵)
28	19, 27	anbi12i 629	. . 3 ⊢ ((𝑥(◡1st ∘ E )⟨𝐴, 𝐵⟩ ∧ 𝑥(◡2nd ∘ E )⟨𝐴, 𝐵⟩) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
29		brin 5152	. . 3 ⊢ (𝑥((◡1st ∘ E ) ∩ (◡2nd ∘ E ))⟨𝐴, 𝐵⟩ ↔ (𝑥(◡1st ∘ E )⟨𝐴, 𝐵⟩ ∧ 𝑥(◡2nd ∘ E )⟨𝐴, 𝐵⟩))
30		elin 3919	. . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
31	28, 29, 30	3bitr4ri 304	. 2 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ 𝑥((◡1st ∘ E ) ∩ (◡2nd ∘ E ))⟨𝐴, 𝐵⟩)
32	1, 2, 3, 8, 31	brtxpsd3 36107	1 ⊢ (⟨𝐴, 𝐵⟩Cap𝐶 ↔ 𝐶 = (𝐴 ∩ 𝐵))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  Vcvv 3442   ∩ cin 3902  ⟨cop 4588   class class class wbr 5100   E cep 5531   × cxp 5630  ^◡ccnv 5631   ∘ ccom 5636  1^st c1st 7941  2^nd c2nd 7942  Capccap 36058

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-symdif 4207  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-eprel 5532  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fo 6506  df-fv 6508  df-1st 7943  df-2nd 7944  df-txp 36065  df-cap 36081

This theorem is referenced by:  brrestrict  36162