Theorem hstrlem2 32870

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 6890	. . 3 ⊢ (𝑥 = 𝐶 → (projℎ‘𝑥) = (projℎ‘𝐶))
2	1	fveq1d 6892	. 2 ⊢ (𝑥 = 𝐶 → ((projℎ‘𝑥)‘𝑢) = ((projℎ‘𝐶)‘𝑢))
3		hstrlem2.1	. 2 ⊢ 𝑆 = (𝑥 ∈ Cℋ ↦ ((projℎ‘𝑥)‘𝑢))
4		fvex 6903	. 2 ⊢ ((projℎ‘𝐶)‘𝑢) ∈ V
5	2, 3, 4	fvmpt 6998	1 ⊢ (𝐶 ∈ Cℋ → (𝑆‘𝐶) = ((projℎ‘𝐶)‘𝑢))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144   ↦ cmpt 5185  ‘cfv 6543   C_ℋ cch 31540  proj_ℎcpjh 31548

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6497  df-fun 6545  df-fv 6551

This theorem is used by:  hstrlem3a  32871  hstrlem4  32873  hstrlem5  32874