Theorem resvval 33777

Description: Value of structure restriction. (Contributed by Thierry Arnoux, 6-Sep-2018.)

Hypotheses

Ref	Expression
resvsca.r	⊢ 𝑅 = (𝑊 ↾v 𝐴)
resvsca.f	⊢ 𝐹 = (Scalar‘𝑊)
resvsca.b	⊢ 𝐵 = (Base‘𝐹)

Assertion

Ref	Expression
resvval	⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑅 = if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)))

Proof of Theorem resvval

Dummy variables 𝑥 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		resvsca.r	. 2 ⊢ 𝑅 = (𝑊 ↾v 𝐴)
2		elex 3474	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		elex 3474	. . 3 ⊢ (𝐴 ∈ 𝑌 → 𝐴 ∈ V)
4		ovex 7450	. . . . . 6 ⊢ (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩) ∈ V
5		ifcl 4531	. . . . . 6 ⊢ ((𝑊 ∈ V ∧ (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩) ∈ V) → if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)) ∈ V)
6	4, 5	mpan2 704	. . . . 5 ⊢ (𝑊 ∈ V → if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)) ∈ V)
7	6	adantr 486	. . . 4 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ V) → if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)) ∈ V)
8		simpl 488	. . . . . . . . . . 11 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → 𝑤 = 𝑊)
9	8	fveq2d 6886	. . . . . . . . . 10 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → (Scalar‘𝑤) = (Scalar‘𝑊))
10		resvsca.f	. . . . . . . . . 10 ⊢ 𝐹 = (Scalar‘𝑊)
11	9, 10	eqtr4di 2815	. . . . . . . . 9 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → (Scalar‘𝑤) = 𝐹)
12	11	fveq2d 6886	. . . . . . . 8 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → (Base‘(Scalar‘𝑤)) = (Base‘𝐹))
13		resvsca.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐹)
14	12, 13	eqtr4di 2815	. . . . . . 7 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → (Base‘(Scalar‘𝑤)) = 𝐵)
15		simpr 490	. . . . . . 7 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴)
16	14, 15	sseq12d 3967	. . . . . 6 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → ((Base‘(Scalar‘𝑤)) ⊆ 𝑥 ↔ 𝐵 ⊆ 𝐴))
17	11, 15	oveq12d 7435	. . . . . . . 8 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → ((Scalar‘𝑤) ↾s 𝑥) = (𝐹 ↾s 𝐴))
18	17	opeq2d 4843	. . . . . . 7 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → ⟨(Scalar‘ndx), ((Scalar‘𝑤) ↾s 𝑥)⟩ = ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)
19	8, 18	oveq12d 7435	. . . . . 6 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → (𝑤 sSet ⟨(Scalar‘ndx), ((Scalar‘𝑤) ↾s 𝑥)⟩) = (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩))
20	16, 8, 19	ifbieq12d 4514	. . . . 5 ⊢ ((𝑤 = 𝑊 ∧ 𝑥 = 𝐴) → if((Base‘(Scalar‘𝑤)) ⊆ 𝑥, 𝑤, (𝑤 sSet ⟨(Scalar‘ndx), ((Scalar‘𝑤) ↾s 𝑥)⟩)) = if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)))
21		df-resv 33775	. . . . 5 ⊢ ↾v = (𝑤 ∈ V, 𝑥 ∈ V ↦ if((Base‘(Scalar‘𝑤)) ⊆ 𝑥, 𝑤, (𝑤 sSet ⟨(Scalar‘ndx), ((Scalar‘𝑤) ↾s 𝑥)⟩)))
22	20, 21	ovmpoga 7571	. . . 4 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ V ∧ if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)) ∈ V) → (𝑊 ↾v 𝐴) = if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)))
23	7, 22	mpd3an3 1491	. . 3 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ V) → (𝑊 ↾v 𝐴) = if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)))
24	2, 3, 23	syl2an 608	. 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 ↾v 𝐴) = if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)))
25	1, 24	eqtrid 2809	1 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑅 = if(𝐵 ⊆ 𝐴, 𝑊, (𝑊 sSet ⟨(Scalar‘ndx), (𝐹 ↾s 𝐴)⟩)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902  ifcif 4485  ⟨cop 4593  ‘cfv 6537  (class class class)co 7417   sSet csts 17261  ndxcnx 17291  Basecbs 17307   ↾_s cress 17328  Scalarcsca 17351   ↾_v cresv 33774

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-resv 33775

This theorem is used by:  resvid2  33778  resvval2  33779