Theorem idref 5610

Description: TODO: This is the same as issref 4877 (which has a much longer proof). Should we replace issref 4877 with this one? - NM 9-May-2016.

Two ways to state a relation is reflexive. (Adapted from Tarski.) (Contributed by FL, 15-Jan-2012.) (Proof shortened by Mario Carneiro, 3-Nov-2015.) (Proof modification is discouraged.)

Assertion

Ref	Expression
idref	|- ( ( _I |` A ) C_ R <-> A. x e. A x R x )

Distinct variable groups:   x, A   x, R

Proof of Theorem idref

Step	Hyp	Ref	Expression
1		eqid 2113	. . . 4 |- ( x e. A |-> <. x , x >. ) = ( x e. A |-> <. x , x >. )
2	1	fmpt 5522	. . 3 |- ( A. x e. A <. x , x >. e. R <-> ( x e. A |-> <. x , x >. ) : A --> R )
3		vex 2658	. . . . . 6 |- x e. _V
4	3, 3	opex 4109	. . . . 5 |- <. x , x >. e. _V
5	4, 1	fnmpti 5207	. . . 4 |- ( x e. A |-> <. x , x >. ) Fn A
6		df-f 5083	. . . 4 |- ( ( x e. A |-> <. x , x >. ) : A --> R <-> ( ( x e. A |-> <. x , x >. ) Fn A /\ ran ( x e. A |-> <. x , x >. ) C_ R ) )
7	5, 6	mpbiran 905	. . 3 |- ( ( x e. A |-> <. x , x >. ) : A --> R <-> ran ( x e. A |-> <. x , x >. ) C_ R )
8	2, 7	bitri 183	. 2 |- ( A. x e. A <. x , x >. e. R <-> ran ( x e. A |-> <. x , x >. ) C_ R )
9		df-br 3894	. . 3 |- ( x R x <-> <. x , x >. e. R )
10	9	ralbii 2413	. 2 |- ( A. x e. A x R x <-> A. x e. A <. x , x >. e. R )
11		mptresid 4829	. . . 4 |- ( x e. A |-> x ) = ( _I |` A )
12	3	fnasrn 5550	. . . 4 |- ( x e. A |-> x ) = ran ( x e. A |-> <. x , x >. )
13	11, 12	eqtr3i 2135	. . 3 |- ( _I |` A ) = ran ( x e. A |-> <. x , x >. )
14	13	sseq1i 3087	. 2 |- ( ( _I |` A ) C_ R <-> ran ( x e. A |-> <. x , x >. ) C_ R )
15	8, 10, 14	3bitr4ri 212	1 |- ( ( _I |` A ) C_ R <-> A. x e. A x R x )

Syntax hints:   <-> wb 104   e. wcel 1461   A.wral 2388   C_ wss 3035   <.cop 3494   class class class wbr 3893   |-> cmpt 3947   _I cid 4168   ran crn 4498   |` cres 4499   Fn wfn 5074   -->wf 5075

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-sep 4004  ax-pow 4056  ax-pr 4089

This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ral 2393  df-rex 2394  df-reu 2395  df-rab 2397  df-v 2657  df-sbc 2877  df-csb 2970  df-un 3039  df-in 3041  df-ss 3048  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-uni 3701  df-iun 3779  df-br 3894  df-opab 3948  df-mpt 3949  df-id 4173  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-dm 4507  df-rn 4508  df-res 4509  df-ima 4510  df-iota 5044  df-fun 5081  df-fn 5082  df-f 5083  df-f1 5084  df-fo 5085  df-f1o 5086  df-fv 5087

This theorem is referenced by: (None)