Theorem idref 5962

Description: TODO: This is the same as issref 5170 (which has a much longer proof). Should we replace issref 5170 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 2238	. . . 4 |- ( x e. A |-> <. x , x >. ) = ( x e. A |-> <. x , x >. )
2	1	fmpt 5858	. . 3 |- ( A. x e. A <. x , x >. e. R <-> ( x e. A |-> <. x , x >. ) : A --> R )
3		vex 2824	. . . . . 6 |- x e. _V
4	3, 3	opex 4369	. . . . 5 |- <. x , x >. e. _V
5	4, 1	fnmpti 5512	. . . 4 |- ( x e. A |-> <. x , x >. ) Fn A
6		df-f 5381	. . . 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 953	. . 3 |- ( ( x e. A |-> <. x , x >. ) : A --> R <-> ran ( x e. A |-> <. x , x >. ) C_ R )
8	2, 7	bitri 184	. 2 |- ( A. x e. A <. x , x >. e. R <-> ran ( x e. A |-> <. x , x >. ) C_ R )
9		df-br 4131	. . 3 |- ( x R x <-> <. x , x >. e. R )
10	9	ralbii 2556	. 2 |- ( A. x e. A x R x <-> A. x e. A <. x , x >. e. R )
11		mptresid 5117	. . . . 5 |- ( _I |` A ) = ( x e. A |-> x )
12	11	eqcomi 2242	. . . 4 |- ( x e. A |-> x ) = ( _I |` A )
13	3	fnasrn 5887	. . . 4 |- ( x e. A |-> x ) = ran ( x e. A |-> <. x , x >. )
14	12, 13	eqtr3i 2261	. . 3 |- ( _I |` A ) = ran ( x e. A |-> <. x , x >. )
15	14	sseq1i 3274	. 2 |- ( ( _I |` A ) C_ R <-> ran ( x e. A |-> <. x , x >. ) C_ R )
16	8, 10, 15	3bitr4ri 213	1 |- ( ( _I |` A ) C_ R <-> A. x e. A x R x )

This proof depends on syntax axioms:   <-> wb 105   e. wcel 2209   A.wral 2528   C_ wss 3220   <.cop 3712   class class class wbr 4130   |-> cmpt 4192   _I cid 4433   ran crn 4775   |` cres 4776   Fn wfn 5372   -->wf 5373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385

This theorem is used by: (None)