Theorem hstrlem2 32854

Description: Lemma for strong set of CH states theorem. (Contributed by NM, 30-Jun-2006.) (New usage is discouraged.)

Hypothesis

Ref	Expression
hstrlem2.1	⊢ 𝑆 = (𝑥 ∈ Cℋ ↦ ((projℎ‘𝑥)‘𝑢))

Assertion

Ref	Expression
hstrlem2	⊢ (𝐶 ∈ Cℋ → (𝑆‘𝐶) = ((projℎ‘𝐶)‘𝑢))

Distinct variable groups:   𝑥,𝐶   𝑥,𝑢

Allowed substitution hints:   𝐶(𝑢)   𝑆(𝑥, 𝑢)

Proof of Theorem hstrlem2

Step	Hyp	Ref	Expression
1		fveq2 6883	. . 3 ⊢ (𝑥 = 𝐶 → (projℎ‘𝑥) = (projℎ‘𝐶))
2	1	fveq1d 6885	. 2 ⊢ (𝑥 = 𝐶 → ((projℎ‘𝑥)‘𝑢) = ((projℎ‘𝐶)‘𝑢))
3		hstrlem2.1	. 2 ⊢ 𝑆 = (𝑥 ∈ Cℋ ↦ ((projℎ‘𝑥)‘𝑢))
4		fvex 6896	. 2 ⊢ ((projℎ‘𝐶)‘𝑢) ∈ V
5	2, 3, 4	fvmpt 6991	1 ⊢ (𝐶 ∈ Cℋ → (𝑆‘𝐶) = ((projℎ‘𝐶)‘𝑢))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  ‘cfv 6537   C_ℋ cch 31524  proj_ℎcpjh 31532

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545

This theorem is used by:  hstrlem3a  32855  hstrlem4  32857  hstrlem5  32858