let F be Field; :: thesis: for S being SymSp of F
for b, a, x, y being Element of S st (1_ F) + (1_ F) <> 0. F & not a _|_ holds
( PProJ a,b,x,y = 0. F iff x _|_ )
let S be SymSp of F; :: thesis: for b, a, x, y being Element of S st (1_ F) + (1_ F) <> 0. F & not a _|_ holds
( PProJ a,b,x,y = 0. F iff x _|_ )
let b, a, x, y be Element of S; :: thesis: ( (1_ F) + (1_ F) <> 0. F & not a _|_ implies ( PProJ a,b,x,y = 0. F iff x _|_ ) )
set 0F = 0. F;
assume that
A1:
(1_ F) + (1_ F) <> 0. F
and
A2:
not a _|_
; :: thesis: ( PProJ a,b,x,y = 0. F iff x _|_ )
A3:
a <> 0. S
by A2, Th11, Th12;
A4:
( PProJ a,b,x,y = 0. F implies x _|_ )
proof
assume A5:
PProJ a,
b,
x,
y = 0. F
;
:: thesis: x _|_
now given p being
Element of
S such that A7:
( not
a _|_ & not
x _|_ )
;
:: thesis: x _|_
((ProJ a,b,p) * (ProJ p,a,x)) * (ProJ x,p,y) = 0. F
by A1, A2, A5, A7, Def6;
then
(
(ProJ a,b,p) * (ProJ p,a,x) = 0. F or
ProJ x,
p,
y = 0. F )
by VECTSP_1:44;
then A8:
(
ProJ a,
b,
p = 0. F or
ProJ p,
a,
x = 0. F or
ProJ x,
p,
y = 0. F )
by VECTSP_1:44;
hence
x _|_
by A2, A7, A8, Th36;
:: thesis: verum end;
hence
x _|_
by A6;
:: thesis: verum
end;
( x _|_ implies PProJ a,b,x,y = 0. F )
proof
assume A10:
x _|_
;
:: thesis: PProJ a,b,x,y = 0. F
now assume
x <> 0. S
;
:: thesis: PProJ a,b,x,y = 0. Fthen consider p being
Element of
S such that A12:
( not
a _|_ & not
x _|_ )
by A3, Th21;
ProJ x,
p,
y = 0. F
by A10, A12, Th36;
then
((ProJ a,b,p) * (ProJ p,a,x)) * (ProJ x,p,y) = 0. F
by VECTSP_1:39;
hence
PProJ a,
b,
x,
y = 0. F
by A1, A2, A12, Def6;
:: thesis: verum end;
hence
PProJ a,
b,
x,
y = 0. F
by A11;
:: thesis: verum
end;
hence
( PProJ a,b,x,y = 0. F iff x _|_ )
by A4; :: thesis: verum