MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ressval Structured version   Visualization version   GIF version

Theorem ressval 16149
Description: Value of structure restriction. (Contributed by Stefan O'Rear, 29-Nov-2014.)
Hypotheses
Ref Expression
ressbas.r 𝑅 = (𝑊s 𝐴)
ressbas.b 𝐵 = (Base‘𝑊)
Assertion
Ref Expression
ressval ((𝑊𝑋𝐴𝑌) → 𝑅 = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))

Proof of Theorem ressval
Dummy variables 𝑤 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ressbas.r . 2 𝑅 = (𝑊s 𝐴)
2 elex 3352 . . 3 (𝑊𝑋𝑊 ∈ V)
3 elex 3352 . . 3 (𝐴𝑌𝐴 ∈ V)
4 simpl 474 . . . . 5 ((𝑊 ∈ V ∧ 𝐴 ∈ V) → 𝑊 ∈ V)
5 ovex 6842 . . . . 5 (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩) ∈ V
6 ifcl 4274 . . . . 5 ((𝑊 ∈ V ∧ (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩) ∈ V) → if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)) ∈ V)
74, 5, 6sylancl 697 . . . 4 ((𝑊 ∈ V ∧ 𝐴 ∈ V) → if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)) ∈ V)
8 simpl 474 . . . . . . . . 9 ((𝑤 = 𝑊𝑎 = 𝐴) → 𝑤 = 𝑊)
98fveq2d 6357 . . . . . . . 8 ((𝑤 = 𝑊𝑎 = 𝐴) → (Base‘𝑤) = (Base‘𝑊))
10 ressbas.b . . . . . . . 8 𝐵 = (Base‘𝑊)
119, 10syl6eqr 2812 . . . . . . 7 ((𝑤 = 𝑊𝑎 = 𝐴) → (Base‘𝑤) = 𝐵)
12 simpr 479 . . . . . . 7 ((𝑤 = 𝑊𝑎 = 𝐴) → 𝑎 = 𝐴)
1311, 12sseq12d 3775 . . . . . 6 ((𝑤 = 𝑊𝑎 = 𝐴) → ((Base‘𝑤) ⊆ 𝑎𝐵𝐴))
1412, 11ineq12d 3958 . . . . . . . 8 ((𝑤 = 𝑊𝑎 = 𝐴) → (𝑎 ∩ (Base‘𝑤)) = (𝐴𝐵))
1514opeq2d 4560 . . . . . . 7 ((𝑤 = 𝑊𝑎 = 𝐴) → ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩ = ⟨(Base‘ndx), (𝐴𝐵)⟩)
168, 15oveq12d 6832 . . . . . 6 ((𝑤 = 𝑊𝑎 = 𝐴) → (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩) = (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩))
1713, 8, 16ifbieq12d 4257 . . . . 5 ((𝑤 = 𝑊𝑎 = 𝐴) → if((Base‘𝑤) ⊆ 𝑎, 𝑤, (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩)) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
18 df-ress 16087 . . . . 5 s = (𝑤 ∈ V, 𝑎 ∈ V ↦ if((Base‘𝑤) ⊆ 𝑎, 𝑤, (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩)))
1917, 18ovmpt2ga 6956 . . . 4 ((𝑊 ∈ V ∧ 𝐴 ∈ V ∧ if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)) ∈ V) → (𝑊s 𝐴) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
207, 19mpd3an3 1574 . . 3 ((𝑊 ∈ V ∧ 𝐴 ∈ V) → (𝑊s 𝐴) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
212, 3, 20syl2an 495 . 2 ((𝑊𝑋𝐴𝑌) → (𝑊s 𝐴) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
221, 21syl5eq 2806 1 ((𝑊𝑋𝐴𝑌) → 𝑅 = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1632  wcel 2139  Vcvv 3340  cin 3714  wss 3715  ifcif 4230  cop 4327  cfv 6049  (class class class)co 6814  ndxcnx 16076   sSet csts 16077  Basecbs 16079  s cress 16080
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pr 5055
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-iota 6012  df-fun 6051  df-fv 6057  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-ress 16087
This theorem is referenced by:  ressid2  16150  ressval2  16151  wunress  16162
  Copyright terms: Public domain W3C validator