cnvcnv - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cnvcnv		Structured version Visualization version GIF version

Theorem cnvcnv 6189

Description: The double converse of a class strips out all elements that are not ordered pairs. (Contributed by NM, 8-Dec-2003.) (Proof shortened by BJ, 26-Nov-2021.)

**Assertion**
Ref	Expression
cnvcnv	⊢ ^◡^◡𝐴 = (𝐴 ∩ (V × V))

**Proof of Theorem cnvcnv**
Step	Hyp	Ref	Expression
1		cnvin 6142	. . 3 ⊢ ^◡(^◡𝐴 ∩ ^◡(V × V)) = (^◡^◡𝐴 ∩ ^◡^◡(V × V))
2		cnvin 6142	. . . 4 ⊢ ^◡(𝐴 ∩ (V × V)) = (^◡𝐴 ∩ ^◡(V × V))
3	2	cnveqi 5873	. . 3 ⊢ ^◡^◡(𝐴 ∩ (V × V)) = ^◡(^◡𝐴 ∩ ^◡(V × V))
4		relcnv 6101	. . . . . 6 ⊢ Rel ^◡^◡𝐴
5		df-rel 5683	. . . . . 6 ⊢ (Rel ^◡^◡𝐴 ↔ ^◡^◡𝐴 ⊆ (V × V))
6	4, 5	mpbi 229	. . . . 5 ⊢ ^◡^◡𝐴 ⊆ (V × V)
7		relxp 5694	. . . . . 6 ⊢ Rel (V × V)
8		dfrel2 6186	. . . . . 6 ⊢ (Rel (V × V) ↔ ^◡^◡(V × V) = (V × V))
9	7, 8	mpbi 229	. . . . 5 ⊢ ^◡^◡(V × V) = (V × V)
10	6, 9	sseqtrri 4019	. . . 4 ⊢ ^◡^◡𝐴 ⊆ ^◡^◡(V × V)
11		dfss 3966	. . . 4 ⊢ (^◡^◡𝐴 ⊆ ^◡^◡(V × V) ↔ ^◡^◡𝐴 = (^◡^◡𝐴 ∩ ^◡^◡(V × V)))
12	10, 11	mpbi 229	. . 3 ⊢ ^◡^◡𝐴 = (^◡^◡𝐴 ∩ ^◡^◡(V × V))
13	1, 3, 12	3eqtr4ri 2772	. 2 ⊢ ^◡^◡𝐴 = ^◡^◡(𝐴 ∩ (V × V))
14		relinxp 5813	. . 3 ⊢ Rel (𝐴 ∩ (V × V))
15		dfrel2 6186	. . 3 ⊢ (Rel (𝐴 ∩ (V × V)) ↔ ^◡^◡(𝐴 ∩ (V × V)) = (𝐴 ∩ (V × V)))
16	14, 15	mpbi 229	. 2 ⊢ ^◡^◡(𝐴 ∩ (V × V)) = (𝐴 ∩ (V × V))
17	13, 16	eqtri 2761	1 ⊢ ^◡^◡𝐴 = (𝐴 ∩ (V × V))

Colors of variables: wff setvar class

Syntax hints: = wceq 1542 Vcvv 3475 ∩ cin 3947 ⊆ wss 3948 × cxp 5674 ^◡ccnv 5675 Rel wrel 5681

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pr 5427

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-rab 3434 df-v 3477 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-xp 5682 df-rel 5683 df-cnv 5684

This theorem is referenced by: cnvcnv2 6190 cnvcnvss 6191 cnvrescnv 6192 structcnvcnv 17083 strfv2d 17132 elcnvcnvintab 42319 relintab 42320 nonrel 42321 elcnvcnvlem 42336 cnvcnvintabd 42337

W3C validator