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

Theorem ressvalsets 13361
Description: Value of structure restriction. (Contributed by Jim Kingdon, 16-Jan-2025.)
Assertion
Ref Expression
ressvalsets ((𝑊𝑋𝐴𝑌) → (𝑊s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))

Proof of Theorem ressvalsets
Dummy variables 𝑤 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2827 . . 3 (𝑊𝑋𝑊 ∈ V)
21adantr 276 . 2 ((𝑊𝑋𝐴𝑌) → 𝑊 ∈ V)
3 elex 2827 . . 3 (𝐴𝑌𝐴 ∈ V)
43adantl 277 . 2 ((𝑊𝑋𝐴𝑌) → 𝐴 ∈ V)
5 simpl 109 . . 3 ((𝑊𝑋𝐴𝑌) → 𝑊𝑋)
6 basendxnn 13352 . . . 4 (Base‘ndx) ∈ ℕ
76a1i 9 . . 3 ((𝑊𝑋𝐴𝑌) → (Base‘ndx) ∈ ℕ)
8 inex1g 4251 . . . 4 (𝐴𝑌 → (𝐴 ∩ (Base‘𝑊)) ∈ V)
98adantl 277 . . 3 ((𝑊𝑋𝐴𝑌) → (𝐴 ∩ (Base‘𝑊)) ∈ V)
10 setsex 13328 . . 3 ((𝑊𝑋 ∧ (Base‘ndx) ∈ ℕ ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩) ∈ V)
115, 7, 9, 10syl3anc 1274 . 2 ((𝑊𝑋𝐴𝑌) → (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩) ∈ V)
12 id 19 . . . 4 (𝑤 = 𝑊𝑤 = 𝑊)
13 fveq2 5675 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
1413ineq2d 3426 . . . . 5 (𝑤 = 𝑊 → (𝑥 ∩ (Base‘𝑤)) = (𝑥 ∩ (Base‘𝑊)))
1514opeq2d 3895 . . . 4 (𝑤 = 𝑊 → ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑤))⟩ = ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩)
1612, 15oveq12d 6076 . . 3 (𝑤 = 𝑊 → (𝑤 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑤))⟩) = (𝑊 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩))
17 ineq1 3419 . . . . 5 (𝑥 = 𝐴 → (𝑥 ∩ (Base‘𝑊)) = (𝐴 ∩ (Base‘𝑊)))
1817opeq2d 3895 . . . 4 (𝑥 = 𝐴 → ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩ = ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩)
1918oveq2d 6074 . . 3 (𝑥 = 𝐴 → (𝑊 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
20 df-iress 13304 . . 3 s = (𝑤 ∈ V, 𝑥 ∈ V ↦ (𝑤 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑤))⟩))
2116, 19, 20ovmpog 6196 . 2 ((𝑊 ∈ V ∧ 𝐴 ∈ V ∧ (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩) ∈ V) → (𝑊s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
222, 4, 11, 21syl3anc 1274 1 ((𝑊𝑋𝐴𝑌) → (𝑊s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  Vcvv 2815  cin 3213  cop 3697  cfv 5357  (class class class)co 6058  cn 9254  ndxcnx 13293   sSet csts 13294  Basecbs 13296  s cress 13297
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-inn 9255  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304
This theorem is referenced by:  ressex  13362  ressval2  13363  ressbasd  13364  strressid  13368  ressval3d  13369  resseqnbasd  13370  ressinbasd  13371  ressressg  13372  mgpress  14170
  Copyright terms: Public domain W3C validator