HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem relres 3393
Description: A restriction is a relation. Exercise 12 of [TakeutiZaring] p. 25.
Assertion
Ref Expression
relres |- Rel (A |` B)

Proof of Theorem relres
StepHypRef Expression
1 df-res 3196 . . 3 |- (A |` B) = (A i^i (B X. V))
2 inss2 2234 . . . 4 |- (A i^i (B X. V)) (_ (B X. V)
3 xpss 3236 . . . 4 |- (B X. V) (_ (V X. V)
42, 3sstri 2076 . . 3 |- (A i^i (B X. V)) (_ (V X. V)
51, 4eqsstr 2094 . 2 |- (A |` B) (_ (V X. V)
6 df-rel 3191 . 2 |- (Rel (A |` B) <-> (A |` B) (_ (V X. V))
75, 6mpbir 190 1 |- Rel (A |` B)
Colors of variables: wff set class
Syntax hints:  Vcvv 1814   i^i cin 2049   (_ wss 2050   X. cxp 3174   |` cres 3178  Rel wrel 3181
This theorem is referenced by:  resiexg 3402  iss 3403  asymref 3445  cnvcnvres 3500  resco 3506  cores2 3513  funssres 3558  resfunexg 3585  fnresdisj 3603  fcnvres 3654
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-opab 2672  df-xp 3190  df-rel 3191  df-res 3196
Copyright terms: Public domain