![]() |
Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HSE Home > Th. List > opsqrlem3 | Structured version Visualization version GIF version |
Description: Lemma for opsqri . (Contributed by NM, 22-Aug-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
opsqrlem2.1 | ⊢ 𝑇 ∈ HrmOp |
opsqrlem2.2 | ⊢ 𝑆 = (𝑥 ∈ HrmOp, 𝑦 ∈ HrmOp ↦ (𝑥 +op ((1 / 2) ·op (𝑇 −op (𝑥 ∘ 𝑥))))) |
opsqrlem2.3 | ⊢ 𝐹 = seq1(𝑆, (ℕ × { 0hop })) |
Ref | Expression |
---|---|
opsqrlem3 | ⊢ ((𝐺 ∈ HrmOp ∧ 𝐻 ∈ HrmOp) → (𝐺𝑆𝐻) = (𝐺 +op ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . 3 ⊢ (𝑧 = 𝐺 → 𝑧 = 𝐺) | |
2 | 1, 1 | coeq12d 5878 | . . . . 5 ⊢ (𝑧 = 𝐺 → (𝑧 ∘ 𝑧) = (𝐺 ∘ 𝐺)) |
3 | 2 | oveq2d 7447 | . . . 4 ⊢ (𝑧 = 𝐺 → (𝑇 −op (𝑧 ∘ 𝑧)) = (𝑇 −op (𝐺 ∘ 𝐺))) |
4 | 3 | oveq2d 7447 | . . 3 ⊢ (𝑧 = 𝐺 → ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧))) = ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺)))) |
5 | 1, 4 | oveq12d 7449 | . 2 ⊢ (𝑧 = 𝐺 → (𝑧 +op ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧)))) = (𝐺 +op ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺))))) |
6 | eqidd 2736 | . 2 ⊢ (𝑤 = 𝐻 → (𝐺 +op ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺)))) = (𝐺 +op ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺))))) | |
7 | opsqrlem2.2 | . . 3 ⊢ 𝑆 = (𝑥 ∈ HrmOp, 𝑦 ∈ HrmOp ↦ (𝑥 +op ((1 / 2) ·op (𝑇 −op (𝑥 ∘ 𝑥))))) | |
8 | id 22 | . . . . 5 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧) | |
9 | 8, 8 | coeq12d 5878 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 ∘ 𝑥) = (𝑧 ∘ 𝑧)) |
10 | 9 | oveq2d 7447 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑇 −op (𝑥 ∘ 𝑥)) = (𝑇 −op (𝑧 ∘ 𝑧))) |
11 | 10 | oveq2d 7447 | . . . . 5 ⊢ (𝑥 = 𝑧 → ((1 / 2) ·op (𝑇 −op (𝑥 ∘ 𝑥))) = ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧)))) |
12 | 8, 11 | oveq12d 7449 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 +op ((1 / 2) ·op (𝑇 −op (𝑥 ∘ 𝑥)))) = (𝑧 +op ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧))))) |
13 | eqidd 2736 | . . . 4 ⊢ (𝑦 = 𝑤 → (𝑧 +op ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧)))) = (𝑧 +op ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧))))) | |
14 | 12, 13 | cbvmpov 7528 | . . 3 ⊢ (𝑥 ∈ HrmOp, 𝑦 ∈ HrmOp ↦ (𝑥 +op ((1 / 2) ·op (𝑇 −op (𝑥 ∘ 𝑥))))) = (𝑧 ∈ HrmOp, 𝑤 ∈ HrmOp ↦ (𝑧 +op ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧))))) |
15 | 7, 14 | eqtri 2763 | . 2 ⊢ 𝑆 = (𝑧 ∈ HrmOp, 𝑤 ∈ HrmOp ↦ (𝑧 +op ((1 / 2) ·op (𝑇 −op (𝑧 ∘ 𝑧))))) |
16 | ovex 7464 | . 2 ⊢ (𝐺 +op ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺)))) ∈ V | |
17 | 5, 6, 15, 16 | ovmpo 7593 | 1 ⊢ ((𝐺 ∈ HrmOp ∧ 𝐻 ∈ HrmOp) → (𝐺𝑆𝐻) = (𝐺 +op ((1 / 2) ·op (𝑇 −op (𝐺 ∘ 𝐺))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 {csn 4631 × cxp 5687 ∘ ccom 5693 (class class class)co 7431 ∈ cmpo 7433 1c1 11154 / cdiv 11918 ℕcn 12264 2c2 12319 seqcseq 14039 +op chos 30967 ·op chot 30968 −op chod 30969 0hop ch0o 30972 HrmOpcho 30979 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-iota 6516 df-fun 6565 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 |
This theorem is referenced by: opsqrlem4 32172 opsqrlem5 32173 |
Copyright terms: Public domain | W3C validator |