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

Theorem ressval 15848
 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 3198 . . 3 (𝑊𝑋𝑊 ∈ V)
3 elex 3198 . . 3 (𝐴𝑌𝐴 ∈ V)
4 simpl 473 . . . . 5 ((𝑊 ∈ V ∧ 𝐴 ∈ V) → 𝑊 ∈ V)
5 ovex 6632 . . . . 5 (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩) ∈ V
6 ifcl 4102 . . . . 5 ((𝑊 ∈ V ∧ (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩) ∈ V) → if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)) ∈ V)
74, 5, 6sylancl 693 . . . 4 ((𝑊 ∈ V ∧ 𝐴 ∈ V) → if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)) ∈ V)
8 simpl 473 . . . . . . . . 9 ((𝑤 = 𝑊𝑎 = 𝐴) → 𝑤 = 𝑊)
98fveq2d 6152 . . . . . . . 8 ((𝑤 = 𝑊𝑎 = 𝐴) → (Base‘𝑤) = (Base‘𝑊))
10 ressbas.b . . . . . . . 8 𝐵 = (Base‘𝑊)
119, 10syl6eqr 2673 . . . . . . 7 ((𝑤 = 𝑊𝑎 = 𝐴) → (Base‘𝑤) = 𝐵)
12 simpr 477 . . . . . . 7 ((𝑤 = 𝑊𝑎 = 𝐴) → 𝑎 = 𝐴)
1311, 12sseq12d 3613 . . . . . 6 ((𝑤 = 𝑊𝑎 = 𝐴) → ((Base‘𝑤) ⊆ 𝑎𝐵𝐴))
1412, 11ineq12d 3793 . . . . . . . 8 ((𝑤 = 𝑊𝑎 = 𝐴) → (𝑎 ∩ (Base‘𝑤)) = (𝐴𝐵))
1514opeq2d 4377 . . . . . . 7 ((𝑤 = 𝑊𝑎 = 𝐴) → ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩ = ⟨(Base‘ndx), (𝐴𝐵)⟩)
168, 15oveq12d 6622 . . . . . 6 ((𝑤 = 𝑊𝑎 = 𝐴) → (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩) = (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩))
1713, 8, 16ifbieq12d 4085 . . . . 5 ((𝑤 = 𝑊𝑎 = 𝐴) → if((Base‘𝑤) ⊆ 𝑎, 𝑤, (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩)) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
18 df-ress 15788 . . . . 5 s = (𝑤 ∈ V, 𝑎 ∈ V ↦ if((Base‘𝑤) ⊆ 𝑎, 𝑤, (𝑤 sSet ⟨(Base‘ndx), (𝑎 ∩ (Base‘𝑤))⟩)))
1917, 18ovmpt2ga 6743 . . . 4 ((𝑊 ∈ V ∧ 𝐴 ∈ V ∧ if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)) ∈ V) → (𝑊s 𝐴) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
207, 19mpd3an3 1422 . . 3 ((𝑊 ∈ V ∧ 𝐴 ∈ V) → (𝑊s 𝐴) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
212, 3, 20syl2an 494 . 2 ((𝑊𝑋𝐴𝑌) → (𝑊s 𝐴) = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
221, 21syl5eq 2667 1 ((𝑊𝑋𝐴𝑌) → 𝑅 = if(𝐵𝐴, 𝑊, (𝑊 sSet ⟨(Base‘ndx), (𝐴𝐵)⟩)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480   ∈ wcel 1987  Vcvv 3186   ∩ cin 3554   ⊆ wss 3555  ifcif 4058  ⟨cop 4154  ‘cfv 5847  (class class class)co 6604  ndxcnx 15778   sSet csts 15779  Basecbs 15781   ↾s cress 15782 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-iota 5810  df-fun 5849  df-fv 5855  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-ress 15788 This theorem is referenced by:  ressid2  15849  ressval2  15850  wunress  15861
 Copyright terms: Public domain W3C validator