Definition df-cnv 4671

Description: Define the converse of a class. Definition 9.12 of [Quine] p. 64. The converse of a binary relation swaps its arguments, i.e., if A e. _V and B e. _V then ( A `' R B <-> B R A ), as proven in brcnv 4849 (see df-br 4034 and df-rel 4670 for more on relations). For example, `' { <. 2 , 6 >. , <. 3 , 9 >. } = { <. 6 , 2 >. , <. 9 , 3 >. }.

We use Quine's breve accent (smile) notation. Like Quine, we use it as a prefix, which eliminates the need for parentheses. "Converse" is Quine's terminology. Some authors use a "minus one" exponent and call it "inverse", especially when the argument is a function, although this is not in general a genuine inverse. (Contributed by NM, 4-Jul-1994.)

Assertion

Ref	Expression
df-cnv	|- `' A = { <. x , y >. | y A x }

Distinct variable group:   x, y, A

Detailed syntax breakdown of Definition df-cnv

Step	Hyp	Ref	Expression
1		cA	. . 3 class A
2	1	ccnv 4662	. 2 class `' A
3		vy	. . . . 5 setvar y
4	3	cv 1363	. . . 4 class y
5		vx	. . . . 5 setvar x
6	5	cv 1363	. . . 4 class x
7	4, 6, 1	wbr 4033	. . 3 wff y A x
8	7, 5, 3	copab 4093	. 2 class { <. x , y >. | y A x }
9	2, 8	wceq 1364	1 wff `' A = { <. x , y >. | y A x }

This definition is referenced by:  cnvss  4839  elcnv  4843  nfcnv  4845  opelcnvg  4846  csbcnvg  4850  cnvco  4851  relcnv  5047  cnvi  5074  cnvun  5075  cnvin  5077  cnvcnv3  5119