ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ressval3d GIF version

Theorem ressval3d 13218
Description: Value of structure restriction, deduction version. (Contributed by AV, 14-Mar-2020.) (Revised by Jim Kingdon, 17-Jan-2025.)
Hypotheses
Ref Expression
ressval3d.r 𝑅 = (𝑆s 𝐴)
ressval3d.b 𝐵 = (Base‘𝑆)
ressval3d.e 𝐸 = (Base‘ndx)
ressval3d.s (𝜑𝑆𝑉)
ressval3d.f (𝜑 → Fun 𝑆)
ressval3d.d (𝜑𝐸 ∈ dom 𝑆)
ressval3d.u (𝜑𝐴𝐵)
Assertion
Ref Expression
ressval3d (𝜑𝑅 = (𝑆 sSet ⟨𝐸, 𝐴⟩))

Proof of Theorem ressval3d
StepHypRef Expression
1 ressval3d.r . . 3 𝑅 = (𝑆s 𝐴)
2 ressval3d.s . . . 4 (𝜑𝑆𝑉)
3 ressval3d.b . . . . . 6 𝐵 = (Base‘𝑆)
4 basfn 13204 . . . . . . 7 Base Fn V
52elexd 2817 . . . . . . 7 (𝜑𝑆 ∈ V)
6 funfvex 5665 . . . . . . . 8 ((Fun Base ∧ 𝑆 ∈ dom Base) → (Base‘𝑆) ∈ V)
76funfni 5439 . . . . . . 7 ((Base Fn V ∧ 𝑆 ∈ V) → (Base‘𝑆) ∈ V)
84, 5, 7sylancr 414 . . . . . 6 (𝜑 → (Base‘𝑆) ∈ V)
93, 8eqeltrid 2318 . . . . 5 (𝜑𝐵 ∈ V)
10 ressval3d.u . . . . 5 (𝜑𝐴𝐵)
119, 10ssexd 4234 . . . 4 (𝜑𝐴 ∈ V)
12 ressvalsets 13210 . . . 4 ((𝑆𝑉𝐴 ∈ V) → (𝑆s 𝐴) = (𝑆 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑆))⟩))
132, 11, 12syl2anc 411 . . 3 (𝜑 → (𝑆s 𝐴) = (𝑆 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑆))⟩))
141, 13eqtrid 2276 . 2 (𝜑𝑅 = (𝑆 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑆))⟩))
15 ressval3d.e . . . . 5 𝐸 = (Base‘ndx)
1615a1i 9 . . . 4 (𝜑𝐸 = (Base‘ndx))
17 df-ss 3214 . . . . . 6 (𝐴𝐵 ↔ (𝐴𝐵) = 𝐴)
1810, 17sylib 122 . . . . 5 (𝜑 → (𝐴𝐵) = 𝐴)
193ineq2i 3407 . . . . 5 (𝐴𝐵) = (𝐴 ∩ (Base‘𝑆))
2018, 19eqtr3di 2279 . . . 4 (𝜑𝐴 = (𝐴 ∩ (Base‘𝑆)))
2116, 20opeq12d 3875 . . 3 (𝜑 → ⟨𝐸, 𝐴⟩ = ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑆))⟩)
2221oveq2d 6044 . 2 (𝜑 → (𝑆 sSet ⟨𝐸, 𝐴⟩) = (𝑆 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑆))⟩))
2314, 22eqtr4d 2267 1 (𝜑𝑅 = (𝑆 sSet ⟨𝐸, 𝐴⟩))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2202  Vcvv 2803  cin 3200  wss 3201  cop 3676  dom cdm 4731  Fun wfun 5327   Fn wfn 5328  cfv 5333  (class class class)co 6028  ndxcnx 13142   sSet csts 13143  Basecbs 13145  s cress 13146
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9186  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator