unoplin - Hilbert Space Explorer

	Hilbert Space Explorer		< Previous Next > Nearby theorems
Mirrors > Home > HSE Home > Th. List > unoplin		Structured version Visualization version GIF version

Theorem unoplin 30862

Description: A unitary operator is linear. Theorem in [AkhiezerGlazman] p. 72. (Contributed by NM, 22-Jan-2006.) (New usage is discouraged.)

**Assertion**
Ref	Expression
unoplin	⊢ (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)

Proof of Theorem unoplin Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		unopf1o 30858	. . 3 ⊢ (𝑇 ∈ UniOp → 𝑇: ℋ–1-1-onto→ ℋ)
2		f1of 6784	. . 3 ⊢ (𝑇: ℋ–1-1-onto→ ℋ → 𝑇: ℋ⟶ ℋ)
3	1, 2	syl 17	. 2 ⊢ (𝑇 ∈ UniOp → 𝑇: ℋ⟶ ℋ)
4		simplll 773	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → 𝑇 ∈ UniOp)
5		hvmulcl 29955	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·_ℎ 𝑦) ∈ ℋ)
6		hvaddcl 29954	. . . . . . . . . . 11 ⊢ (((𝑥 ·_ℎ 𝑦) ∈ ℋ ∧ 𝑧 ∈ ℋ) → ((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ∈ ℋ)
7	5, 6	sylan 580	. . . . . . . . . 10 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ∈ ℋ)
8	7	adantll 712	. . . . . . . . 9 ⊢ (((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ∈ ℋ)
9	8	adantr 481	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ∈ ℋ)
10		simpr 485	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → 𝑤 ∈ ℋ)
11		unopadj 30861	. . . . . . . 8 ⊢ ((𝑇 ∈ UniOp ∧ ((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ·_ih (^◡𝑇‘𝑤)))
12	4, 9, 10, 11	syl3anc 1371	. . . . . . 7 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ·_ih (^◡𝑇‘𝑤)))
13		simprl 769	. . . . . . . . 9 ⊢ ((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → 𝑥 ∈ ℂ)
14	13	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → 𝑥 ∈ ℂ)
15		simprr 771	. . . . . . . . 9 ⊢ ((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → 𝑦 ∈ ℋ)
16	15	ad2antrr 724	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → 𝑦 ∈ ℋ)
17		simplr 767	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → 𝑧 ∈ ℋ)
18		cnvunop 30860	. . . . . . . . . . . 12 ⊢ (𝑇 ∈ UniOp → ^◡𝑇 ∈ UniOp)
19		unopf1o 30858	. . . . . . . . . . . 12 ⊢ (^◡𝑇 ∈ UniOp → ^◡𝑇: ℋ–1-1-onto→ ℋ)
20		f1of 6784	. . . . . . . . . . . 12 ⊢ (^◡𝑇: ℋ–1-1-onto→ ℋ → ^◡𝑇: ℋ⟶ ℋ)
21	18, 19, 20	3syl 18	. . . . . . . . . . 11 ⊢ (𝑇 ∈ UniOp → ^◡𝑇: ℋ⟶ ℋ)
22	21	ffvelcdmda 7035	. . . . . . . . . 10 ⊢ ((𝑇 ∈ UniOp ∧ 𝑤 ∈ ℋ) → (^◡𝑇‘𝑤) ∈ ℋ)
23	22	adantlr 713	. . . . . . . . 9 ⊢ (((𝑇 ∈ UniOp ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (^◡𝑇‘𝑤) ∈ ℋ)
24	23	adantllr 717	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (^◡𝑇‘𝑤) ∈ ℋ)
25		hiassdi 30033	. . . . . . . 8 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ (𝑧 ∈ ℋ ∧ (^◡𝑇‘𝑤) ∈ ℋ)) → (((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ·_ih (^◡𝑇‘𝑤)) = ((𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))) + (𝑧 ·_ih (^◡𝑇‘𝑤))))
26	14, 16, 17, 24, 25	syl22anc 837	. . . . . . 7 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ·_ih (^◡𝑇‘𝑤)) = ((𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))) + (𝑧 ·_ih (^◡𝑇‘𝑤))))
27	3	ffvelcdmda 7035	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (𝑇‘𝑦) ∈ ℋ)
28	27	adantrl 714	. . . . . . . . . 10 ⊢ ((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑇‘𝑦) ∈ ℋ)
29	28	ad2antrr 724	. . . . . . . . 9 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (𝑇‘𝑦) ∈ ℋ)
30	3	ffvelcdmda 7035	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ UniOp ∧ 𝑧 ∈ ℋ) → (𝑇‘𝑧) ∈ ℋ)
31	30	adantr 481	. . . . . . . . . 10 ⊢ (((𝑇 ∈ UniOp ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (𝑇‘𝑧) ∈ ℋ)
32	31	adantllr 717	. . . . . . . . 9 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (𝑇‘𝑧) ∈ ℋ)
33		hiassdi 30033	. . . . . . . . 9 ⊢ (((𝑥 ∈ ℂ ∧ (𝑇‘𝑦) ∈ ℋ) ∧ ((𝑇‘𝑧) ∈ ℋ ∧ 𝑤 ∈ ℋ)) → (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤) = ((𝑥 · ((𝑇‘𝑦) ·_ih 𝑤)) + ((𝑇‘𝑧) ·_ih 𝑤)))
34	14, 29, 32, 10, 33	syl22anc 837	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤) = ((𝑥 · ((𝑇‘𝑦) ·_ih 𝑤)) + ((𝑇‘𝑧) ·_ih 𝑤)))
35		unopadj 30861	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((𝑇‘𝑦) ·_ih 𝑤) = (𝑦 ·_ih (^◡𝑇‘𝑤)))
36	35	3expa 1118	. . . . . . . . . . . 12 ⊢ (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑇‘𝑦) ·_ih 𝑤) = (𝑦 ·_ih (^◡𝑇‘𝑤)))
37	36	oveq2d 7373	. . . . . . . . . . 11 ⊢ (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (𝑥 · ((𝑇‘𝑦) ·_ih 𝑤)) = (𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))))
38	37	adantlrl 718	. . . . . . . . . 10 ⊢ (((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑤 ∈ ℋ) → (𝑥 · ((𝑇‘𝑦) ·_ih 𝑤)) = (𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))))
39	38	adantlr 713	. . . . . . . . 9 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → (𝑥 · ((𝑇‘𝑦) ·_ih 𝑤)) = (𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))))
40		unopadj 30861	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ UniOp ∧ 𝑧 ∈ ℋ ∧ 𝑤 ∈ ℋ) → ((𝑇‘𝑧) ·_ih 𝑤) = (𝑧 ·_ih (^◡𝑇‘𝑤)))
41	40	3expa 1118	. . . . . . . . . 10 ⊢ (((𝑇 ∈ UniOp ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑇‘𝑧) ·_ih 𝑤) = (𝑧 ·_ih (^◡𝑇‘𝑤)))
42	41	adantllr 717	. . . . . . . . 9 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑇‘𝑧) ·_ih 𝑤) = (𝑧 ·_ih (^◡𝑇‘𝑤)))
43	39, 42	oveq12d 7375	. . . . . . . 8 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑥 · ((𝑇‘𝑦) ·_ih 𝑤)) + ((𝑇‘𝑧) ·_ih 𝑤)) = ((𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))) + (𝑧 ·_ih (^◡𝑇‘𝑤))))
44	34, 43	eqtr2d 2777	. . . . . . 7 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑥 · (𝑦 ·_ih (^◡𝑇‘𝑤))) + (𝑧 ·_ih (^◡𝑇‘𝑤))) = (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤))
45	12, 26, 44	3eqtrd 2780	. . . . . 6 ⊢ ((((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) ∧ 𝑤 ∈ ℋ) → ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤))
46	45	ralrimiva 3143	. . . . 5 ⊢ (((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → ∀𝑤 ∈ ℋ ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤))
47		ffvelcdm 7032	. . . . . . . . 9 ⊢ ((𝑇: ℋ⟶ ℋ ∧ ((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧) ∈ ℋ) → (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ∈ ℋ)
48	7, 47	sylan2 593	. . . . . . . 8 ⊢ ((𝑇: ℋ⟶ ℋ ∧ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) ∧ 𝑧 ∈ ℋ)) → (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ∈ ℋ)
49	48	anassrs 468	. . . . . . 7 ⊢ (((𝑇: ℋ⟶ ℋ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ∈ ℋ)
50		ffvelcdm 7032	. . . . . . . . . . 11 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → (𝑇‘𝑦) ∈ ℋ)
51		hvmulcl 29955	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ (𝑇‘𝑦) ∈ ℋ) → (𝑥 ·_ℎ (𝑇‘𝑦)) ∈ ℋ)
52	50, 51	sylan2 593	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℂ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ℎ (𝑇‘𝑦)) ∈ ℋ)
53	52	an12s 647	. . . . . . . . 9 ⊢ ((𝑇: ℋ⟶ ℋ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ℎ (𝑇‘𝑦)) ∈ ℋ)
54	53	adantr 481	. . . . . . . 8 ⊢ (((𝑇: ℋ⟶ ℋ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → (𝑥 ·_ℎ (𝑇‘𝑦)) ∈ ℋ)
55		ffvelcdm 7032	. . . . . . . . 9 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑧 ∈ ℋ) → (𝑇‘𝑧) ∈ ℋ)
56	55	adantlr 713	. . . . . . . 8 ⊢ (((𝑇: ℋ⟶ ℋ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → (𝑇‘𝑧) ∈ ℋ)
57		hvaddcl 29954	. . . . . . . 8 ⊢ (((𝑥 ·_ℎ (𝑇‘𝑦)) ∈ ℋ ∧ (𝑇‘𝑧) ∈ ℋ) → ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ∈ ℋ)
58	54, 56, 57	syl2anc 584	. . . . . . 7 ⊢ (((𝑇: ℋ⟶ ℋ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ∈ ℋ)
59		hial2eq 30048	. . . . . . 7 ⊢ (((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ∈ ℋ ∧ ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ∈ ℋ) → (∀𝑤 ∈ ℋ ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
60	49, 58, 59	syl2anc 584	. . . . . 6 ⊢ (((𝑇: ℋ⟶ ℋ ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → (∀𝑤 ∈ ℋ ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
61	3, 60	sylanl1 678	. . . . 5 ⊢ (((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → (∀𝑤 ∈ ℋ ((𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) ·_ih 𝑤) = (((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)) ·_ih 𝑤) ↔ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
62	46, 61	mpbid 231	. . . 4 ⊢ (((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) ∧ 𝑧 ∈ ℋ) → (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
63	62	ralrimiva 3143	. . 3 ⊢ ((𝑇 ∈ UniOp ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ)) → ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
64	63	ralrimivva 3197	. 2 ⊢ (𝑇 ∈ UniOp → ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧)))
65		ellnop 30800	. 2 ⊢ (𝑇 ∈ LinOp ↔ (𝑇: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ ℋ ∀𝑧 ∈ ℋ (𝑇‘((𝑥 ·_ℎ 𝑦) +_ℎ 𝑧)) = ((𝑥 ·_ℎ (𝑇‘𝑦)) +_ℎ (𝑇‘𝑧))))
66	3, 64, 65	sylanbrc 583	1 ⊢ (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3064 ^◡ccnv 5632 ⟶wf 6492 –1-1-onto→wf1o 6495 ‘cfv 6496 (class class class)co 7357 ℂcc 11049 + caddc 11054 · cmul 11056 ℋchba 29861 +_ℎ cva 29862 ·_ℎ csm 29863 ·_ih csp 29864 LinOpclo 29889 UniOpcuo 29891

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 ax-hilex 29941 ax-hfvadd 29942 ax-hvcom 29943 ax-hvass 29944 ax-hv0cl 29945 ax-hvaddid 29946 ax-hfvmul 29947 ax-hvmulid 29948 ax-hvdistr2 29951 ax-hvmul0 29952 ax-hfi 30021 ax-his1 30024 ax-his2 30025 ax-his3 30026 ax-his4 30027

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-po 5545 df-so 5546 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-er 8648 df-map 8767 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-div 11813 df-2 12216 df-cj 14984 df-re 14985 df-im 14986 df-hvsub 29913 df-lnop 30783 df-unop 30785

This theorem is referenced by: unopadj2 30880 idlnop 30934 elunop2 30955 nmopun 30956 unopbd 30957

W3C validator