Theorem reldmress 17324

Description: The structure restriction is a proper operator, so it can be used with ovprc1 7452. (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 17323	. 2 ⊢ ↾s = (𝑤 ∈ V, 𝑎 ∈ V ↦ if((Base‘𝑤) ⊆ 𝑎, 𝑤, (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩)))
2	1	reldmmpo 7547	1 ⊢ Rel dom ↾s

This proof depends on syntax axioms:  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  ifcif 4482  ⟨cop 4590  dom cdm 5655  Rel wrel 5660  ‘cfv 6533  (class class class)co 7413   sSet csts 17255  ndxcnx 17285  Basecbs 17301   ↾_s cress 17322

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-dm 5665  df-oprab 7417  df-mpo 7418  df-ress 17323

This theorem is used by:  ressbas  17328  ressbasssg  17329  ressbasssOLD  17332  resseqnbas  17334  ress0  17335  ressinbas  17337  ressress  17339  wunress  17341  subcmn  19964  submomnd  20259  suborng  21042  srasca  21364  rlmsca2  21383  resstopn  23411  cphsubrglem  25405