ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  idref Unicode version

Theorem idref 5759
Description: TODO: This is the same as issref 5013 (which has a much longer proof). Should we replace issref 5013 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
StepHypRef Expression
1 eqid 2177 . . . 4  |-  ( x  e.  A  |->  <. x ,  x >. )  =  ( x  e.  A  |->  <.
x ,  x >. )
21fmpt 5668 . . 3  |-  ( A. x  e.  A  <. x ,  x >.  e.  R  <->  ( x  e.  A  |->  <.
x ,  x >. ) : A --> R )
3 vex 2742 . . . . . 6  |-  x  e. 
_V
43, 3opex 4231 . . . . 5  |-  <. x ,  x >.  e.  _V
54, 1fnmpti 5346 . . . 4  |-  ( x  e.  A  |->  <. x ,  x >. )  Fn  A
6 df-f 5222 . . . 4  |-  ( ( x  e.  A  |->  <.
x ,  x >. ) : A --> R  <->  ( (
x  e.  A  |->  <.
x ,  x >. )  Fn  A  /\  ran  ( x  e.  A  |-> 
<. x ,  x >. ) 
C_  R ) )
75, 6mpbiran 940 . . 3  |-  ( ( x  e.  A  |->  <.
x ,  x >. ) : A --> R  <->  ran  ( x  e.  A  |->  <. x ,  x >. )  C_  R
)
82, 7bitri 184 . 2  |-  ( A. x  e.  A  <. x ,  x >.  e.  R  <->  ran  ( x  e.  A  |-> 
<. x ,  x >. ) 
C_  R )
9 df-br 4006 . . 3  |-  ( x R x  <->  <. x ,  x >.  e.  R
)
109ralbii 2483 . 2  |-  ( A. x  e.  A  x R x  <->  A. x  e.  A  <. x ,  x >.  e.  R )
11 mptresid 4963 . . . 4  |-  ( x  e.  A  |->  x )  =  (  _I  |`  A )
123fnasrn 5696 . . . 4  |-  ( x  e.  A  |->  x )  =  ran  ( x  e.  A  |->  <. x ,  x >. )
1311, 12eqtr3i 2200 . . 3  |-  (  _I  |`  A )  =  ran  ( x  e.  A  |-> 
<. x ,  x >. )
1413sseq1i 3183 . 2  |-  ( (  _I  |`  A )  C_  R  <->  ran  ( x  e.  A  |->  <. x ,  x >. )  C_  R )
158, 10, 143bitr4ri 213 1  |-  ( (  _I  |`  A )  C_  R  <->  A. x  e.  A  x R x )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    e. wcel 2148   A.wral 2455    C_ wss 3131   <.cop 3597   class class class wbr 4005    |-> cmpt 4066    _I cid 4290   ran crn 4629    |` cres 4630    Fn wfn 5213   -->wf 5214
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-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  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-iun 3890  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-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator