Theorem ressvalsets 12682

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.

Step	Hyp	Ref	Expression
1		elex 2771	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2	1	adantr 276	. 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑊 ∈ V)
3		elex 2771	. . 3 ⊢ (𝐴 ∈ 𝑌 → 𝐴 ∈ V)
4	3	adantl 277	. 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝐴 ∈ V)
5		simpl 109	. . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑊 ∈ 𝑋)
6		basendxnn 12674	. . . 4 ⊢ (Base‘ndx) ∈ ℕ
7	6	a1i 9	. . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (Base‘ndx) ∈ ℕ)
8		inex1g 4165	. . . 4 ⊢ (𝐴 ∈ 𝑌 → (𝐴 ∩ (Base‘𝑊)) ∈ V)
9	8	adantl 277	. . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝐴 ∩ (Base‘𝑊)) ∈ V)
10		setsex 12650	. . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ (Base‘ndx) ∈ ℕ ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩) ∈ V)
11	5, 7, 9, 10	syl3anc 1249	. 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩) ∈ V)
12		id 19	. . . 4 ⊢ (𝑤 = 𝑊 → 𝑤 = 𝑊)
13		fveq2 5554	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
14	13	ineq2d 3360	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑥 ∩ (Base‘𝑤)) = (𝑥 ∩ (Base‘𝑊)))
15	14	opeq2d 3811	. . . 4 ⊢ (𝑤 = 𝑊 → ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑤))⟩ = ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩)
16	12, 15	oveq12d 5936	. . 3 ⊢ (𝑤 = 𝑊 → (𝑤 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑤))⟩) = (𝑊 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩))
17		ineq1 3353	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ (Base‘𝑊)) = (𝐴 ∩ (Base‘𝑊)))
18	17	opeq2d 3811	. . . 4 ⊢ (𝑥 = 𝐴 → ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩ = ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩)
19	18	oveq2d 5934	. . 3 ⊢ (𝑥 = 𝐴 → (𝑊 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑊))⟩) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
20		df-iress 12626	. . 3 ⊢ ↾s = (𝑤 ∈ V, 𝑥 ∈ V ↦ (𝑤 sSet ⟨(Base‘ndx), (𝑥 ∩ (Base‘𝑤))⟩))
21	16, 19, 20	ovmpog 6053	. 2 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ V ∧ (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩) ∈ V) → (𝑊 ↾s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))
22	2, 4, 11, 21	syl3anc 1249	1 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 ↾s 𝐴) = (𝑊 sSet ⟨(Base‘ndx), (𝐴 ∩ (Base‘𝑊))⟩))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164  Vcvv 2760   ∩ cin 3152  ⟨cop 3621  ‘cfv 5254  (class class class)co 5918  ℕcn 8982  ndxcnx 12615   sSet csts 12616  Basecbs 12618   ↾_s cress 12619

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-inn 8983  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626

This theorem is referenced by:  ressex  12683  ressval2  12684  ressbasd  12685  strressid  12689  ressval3d  12690  resseqnbasd  12691  ressinbasd  12692  ressressg  12693  mgpress  13427