Theorem reldmress 17202

Description: The structure restriction is a proper operator, so it can be used with ovprc1 7406. (Contributed by Stefan O'Rear, 29-Nov-2014.)

Assertion

Ref	Expression
reldmress	⊢ Rel dom ↾s

Proof of Theorem reldmress

Dummy variables 𝑤 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ress 17201	. 2 ⊢ ↾s = (𝑤 ∈ V, 𝑎 ∈ V ↦ if((Base‘𝑤) ⊆ 𝑎, 𝑤, (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩)))
2	1	reldmmpo 7501	1 ⊢ Rel dom ↾s

Syntax hints:  Vcvv 3429   ∩ cin 3888   ⊆ wss 3889  ifcif 4466  ⟨cop 4573  dom cdm 5631  Rel wrel 5636  ‘cfv 6498  (class class class)co 7367   sSet csts 17133  ndxcnx 17163  Basecbs 17179   ↾_s cress 17200

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-dm 5641  df-oprab 7371  df-mpo 7372  df-ress 17201

This theorem is referenced by:  ressbas  17206  ressbasssg  17207  ressbasssOLD  17210  resseqnbas  17212  ress0  17213  ressinbas  17215  ressress  17217  wunress  17219  subcmn  19812  submomnd  20107  suborng  20853  srasca  21175  rlmsca2  21194  resstopn  23151  cphsubrglem  25144