Theorem elimph 30979

Description: Hypothesis elimination lemma for complex inner product spaces to assist weak deduction theorem. (Contributed by NM, 27-Apr-2007.) (New usage is discouraged.)

Hypotheses

Ref	Expression
elimph.1	⊢ 𝑋 = (BaseSet‘𝑈)
elimph.5	⊢ 𝑍 = (0vec‘𝑈)
elimph.6	⊢ 𝑈 ∈ CPreHilOLD

Assertion

Ref	Expression
elimph	⊢ if(𝐴 ∈ 𝑋, 𝐴, 𝑍) ∈ 𝑋

Proof of Theorem elimph

Step	Hyp	Ref	Expression
1		elimph.1	. 2 ⊢ 𝑋 = (BaseSet‘𝑈)
2		elimph.5	. 2 ⊢ 𝑍 = (0vec‘𝑈)
3		elimph.6	. . 3 ⊢ 𝑈 ∈ CPreHilOLD
4	3	phnvi 30975	. 2 ⊢ 𝑈 ∈ NrmCVec
5	1, 2, 4	elimnv 30842	1 ⊢ if(𝐴 ∈ 𝑋, 𝐴, 𝑍) ∈ 𝑋

Syntax hints:   = wceq 1559   ∈ wcel 2141  ifcif 4477  ‘cfv 6515  BaseSetcba 30745  0_veccn0v 30747  CPreHil_OLDccphlo 30971

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7712

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-1st 7964  df-2nd 7965  df-grpo 30652  df-gid 30653  df-ablo 30704  df-vc 30718  df-nv 30751  df-va 30754  df-ba 30755  df-sm 30756  df-0v 30757  df-nmcv 30759  df-ph 30972

This theorem is referenced by:  ipdiri  30989  ipassi  31000  sii  31013