let x be set ; for P being non empty strict chain-complete Poset
for G being non empty Chain of (ConPoset P,P)
for n being Nat
for X being set st X = { p where p is Element of P : ex g being Element of (ConPoset P,P) ex h being continuous Function of P,P st
( h = g & g in G & p = (iter h,n) . (Bottom P) ) } & x in X holds
x is Element of P
let P be non empty strict chain-complete Poset; for G being non empty Chain of (ConPoset P,P)
for n being Nat
for X being set st X = { p where p is Element of P : ex g being Element of (ConPoset P,P) ex h being continuous Function of P,P st
( h = g & g in G & p = (iter h,n) . (Bottom P) ) } & x in X holds
x is Element of P
let G be non empty Chain of (ConPoset P,P); for n being Nat
for X being set st X = { p where p is Element of P : ex g being Element of (ConPoset P,P) ex h being continuous Function of P,P st
( h = g & g in G & p = (iter h,n) . (Bottom P) ) } & x in X holds
x is Element of P
let n be Nat; for X being set st X = { p where p is Element of P : ex g being Element of (ConPoset P,P) ex h being continuous Function of P,P st
( h = g & g in G & p = (iter h,n) . (Bottom P) ) } & x in X holds
x is Element of P
let X be set ; ( X = { p where p is Element of P : ex g being Element of (ConPoset P,P) ex h being continuous Function of P,P st
( h = g & g in G & p = (iter h,n) . (Bottom P) ) } & x in X implies x is Element of P )
assume A0:
X = { p where p is Element of P : ex g being Element of (ConPoset P,P) ex h being continuous Function of P,P st
( h = g & g in G & p = (iter h,n) . (Bottom P) ) }
; ( not x in X or x is Element of P )
( x in X implies x is Element of P )
hence
( not x in X or x is Element of P )
; verum