Theorem fliftcnv 5798

Description: Converse of the relation F. (Contributed by Mario Carneiro, 23-Dec-2016.)

Hypotheses

Ref	Expression
flift.1	|- F = ran ( x e. X |-> <. A , B >. )
flift.2	|- ( ( ph /\ x e. X ) -> A e. R )
flift.3	|- ( ( ph /\ x e. X ) -> B e. S )

Assertion

Ref	Expression
fliftcnv	|- ( ph -> `' F = ran ( x e. X |-> <. B , A >. ) )

Distinct variable groups:   x, R   ph, x   x, X   x, S

Allowed substitution hints:   A( x)   B( x)   F( x)

Proof of Theorem fliftcnv

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2177	. . . . 5 |- ran ( x e. X |-> <. B , A >. ) = ran ( x e. X |-> <. B , A >. )
2		flift.3	. . . . 5 |- ( ( ph /\ x e. X ) -> B e. S )
3		flift.2	. . . . 5 |- ( ( ph /\ x e. X ) -> A e. R )
4	1, 2, 3	fliftrel 5795	. . . 4 |- ( ph -> ran ( x e. X |-> <. B , A >. ) C_ ( S X. R ) )
5		relxp 4737	. . . 4 |- Rel ( S X. R )
6		relss 4715	. . . 4 |- ( ran ( x e. X |-> <. B , A >. ) C_ ( S X. R ) -> ( Rel ( S X. R ) -> Rel ran ( x e. X |-> <. B , A >. ) ) )
7	4, 5, 6	mpisyl 1446	. . 3 |- ( ph -> Rel ran ( x e. X |-> <. B , A >. ) )
8		relcnv 5008	. . 3 |- Rel `' F
9	7, 8	jctil 312	. 2 |- ( ph -> ( Rel `' F /\ Rel ran ( x e. X |-> <. B , A >. ) ) )
10		flift.1	. . . . . . 7 |- F = ran ( x e. X |-> <. A , B >. )
11	10, 3, 2	fliftel 5796	. . . . . 6 |- ( ph -> ( z F y <-> E. x e. X ( z = A /\ y = B ) ) )
12		vex 2742	. . . . . . 7 |- y e. _V
13		vex 2742	. . . . . . 7 |- z e. _V
14	12, 13	brcnv 4812	. . . . . 6 |- ( y `' F z <-> z F y )
15		ancom 266	. . . . . . 7 |- ( ( y = B /\ z = A ) <-> ( z = A /\ y = B ) )
16	15	rexbii 2484	. . . . . 6 |- ( E. x e. X ( y = B /\ z = A ) <-> E. x e. X ( z = A /\ y = B ) )
17	11, 14, 16	3bitr4g 223	. . . . 5 |- ( ph -> ( y `' F z <-> E. x e. X ( y = B /\ z = A ) ) )
18	1, 2, 3	fliftel 5796	. . . . 5 |- ( ph -> ( y ran ( x e. X |-> <. B , A >. ) z <-> E. x e. X ( y = B /\ z = A ) ) )
19	17, 18	bitr4d 191	. . . 4 |- ( ph -> ( y `' F z <-> y ran ( x e. X |-> <. B , A >. ) z ) )
20		df-br 4006	. . . 4 |- ( y `' F z <-> <. y , z >. e. `' F )
21		df-br 4006	. . . 4 |- ( y ran ( x e. X |-> <. B , A >. ) z <-> <. y , z >. e. ran ( x e. X |-> <. B , A >. ) )
22	19, 20, 21	3bitr3g 222	. . 3 |- ( ph -> ( <. y , z >. e. `' F <-> <. y , z >. e. ran ( x e. X |-> <. B , A >. ) ) )
23	22	eqrelrdv2 4727	. 2 |- ( ( ( Rel `' F /\ Rel ran ( x e. X |-> <. B , A >. ) ) /\ ph ) -> `' F = ran ( x e. X |-> <. B , A >. ) )
24	9, 23	mpancom 422	1 |- ( ph -> `' F = ran ( x e. X |-> <. B , A >. ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1353   e. wcel 2148   E.wrex 2456   C_ wss 3131   <.cop 3597   class class class wbr 4005   |-> cmpt 4066   X. cxp 4626   `'ccnv 4627   ran crn 4629   Rel wrel 4633

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226

This theorem is referenced by: (None)