Theorem reldif 4557

Description: A difference cutting down a relation is a relation. (Contributed by NM, 31-Mar-1998.)

Assertion

Ref	Expression
reldif	|- ( Rel A -> Rel ( A \ B ) )

Proof of Theorem reldif

Step	Hyp	Ref	Expression
1		difss 3126	. 2 |- ( A \ B ) C_ A
2		relss 4525	. 2 |- ( ( A \ B ) C_ A -> ( Rel A -> Rel ( A \ B ) ) )
3	1, 2	ax-mp 7	1 |- ( Rel A -> Rel ( A \ B ) )

Syntax hints:   -> wi 4   \ cdif 2996   C_ wss 2999   Rel wrel 4443

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070

This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-dif 3001  df-in 3005  df-ss 3012  df-rel 4445

This theorem is referenced by:  difopab  4569