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

Theorem idref 5799
Description: TODO: This is the same as issref 5048 (which has a much longer proof). Should we replace issref 5048 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 2193 . . . 4  |-  ( x  e.  A  |->  <. x ,  x >. )  =  ( x  e.  A  |->  <.
x ,  x >. )
21fmpt 5708 . . 3  |-  ( A. x  e.  A  <. x ,  x >.  e.  R  <->  ( x  e.  A  |->  <.
x ,  x >. ) : A --> R )
3 vex 2763 . . . . . 6  |-  x  e. 
_V
43, 3opex 4258 . . . . 5  |-  <. x ,  x >.  e.  _V
54, 1fnmpti 5382 . . . 4  |-  ( x  e.  A  |->  <. x ,  x >. )  Fn  A
6 df-f 5258 . . . 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 942 . . 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 4030 . . 3  |-  ( x R x  <->  <. x ,  x >.  e.  R
)
109ralbii 2500 . 2  |-  ( A. x  e.  A  x R x  <->  A. x  e.  A  <. x ,  x >.  e.  R )
11 mptresid 4996 . . . . 5  |-  (  _I  |`  A )  =  ( x  e.  A  |->  x )
1211eqcomi 2197 . . . 4  |-  ( x  e.  A  |->  x )  =  (  _I  |`  A )
133fnasrn 5736 . . . 4  |-  ( x  e.  A  |->  x )  =  ran  ( x  e.  A  |->  <. x ,  x >. )
1412, 13eqtr3i 2216 . . 3  |-  (  _I  |`  A )  =  ran  ( x  e.  A  |-> 
<. x ,  x >. )
1514sseq1i 3205 . 2  |-  ( (  _I  |`  A )  C_  R  <->  ran  ( x  e.  A  |->  <. x ,  x >. )  C_  R )
168, 10, 153bitr4ri 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 2164   A.wral 2472    C_ wss 3153   <.cop 3621   class class class wbr 4029    |-> cmpt 4090    _I cid 4319   ran crn 4660    |` cres 4661    Fn wfn 5249   -->wf 5250
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator