:: QC_LANG4 semantic presentation

theorem :: QC_LANG4:1

canceled;

theorem :: QC_LANG4:2

canceled;

theorem :: QC_LANG4:3

canceled;

theorem Th4: :: QC_LANG4:4

for n being Nat
for r being FinSequence ex q being FinSequence st
( q = r | (Seg n) & q is_a_prefix_of r )

proof end;

theorem :: QC_LANG4:5

canceled;

theorem Th6: :: QC_LANG4:6

for D being non empty set
for r being FinSequence of D
for r1, r2 being FinSequence
for k being Nat st k + 1 <= len r & r1 = r | (Seg (k + 1)) & r2 = r | (Seg k) holds
ex x being Element of D st r1 = r2 ^ <*x*>

proof end;

theorem Th7: :: QC_LANG4:7

for D being non empty set
for r being FinSequence of D
for r1 being FinSequence st 1 <= len r & r1 = r | (Seg 1) holds
ex x being Element of D st r1 = <*x*>

proof end;

registration

let D be non empty set ;
cluster finite ParametrizedSubset of D;
existence

proof end;

end;

theorem Th8: :: QC_LANG4:8

for T being DecoratedTree
for p being FinSequence of NAT holds T . p = (T | p) . {}

proof end;

theorem Th9: :: QC_LANG4:9

for T being finite-branching DecoratedTree
for t being Element of dom T holds succ T,t = T * (t succ )

proof end;

theorem Th10: :: QC_LANG4:10

for T being finite-branching DecoratedTree
for t being Element of dom T holds dom (T * (t succ )) = dom (t succ )

proof end;

theorem Th11: :: QC_LANG4:11

for T being finite-branching DecoratedTree
for t being Element of dom T holds dom (succ T,t) = dom (t succ )

proof end;

theorem Th12: :: QC_LANG4:12

for T being finite-branching DecoratedTree
for t being Element of dom T
for n being Nat holds
( t ^ <*n*> in dom T iff n + 1 in dom (t succ ) )

proof end;

theorem Th13: :: QC_LANG4:13

for T being finite-branching DecoratedTree
for x being FinSequence
for n being Nat st x ^ <*n*> in dom T holds
T . (x ^ <*n*>) = (succ T,x) . (n + 1)

proof end;

theorem Th14: :: QC_LANG4:14

for T being finite-branching DecoratedTree
for x', x being Element of dom T st x' in succ x holds
T . x' in rng (succ T,x)

proof end;

theorem Th15: :: QC_LANG4:15

for T being finite-branching DecoratedTree
for x being Element of dom T
for y' being set st y' in rng (succ T,x) holds
ex x' being Element of dom T st
( y' = T . x' & x' in succ x )

proof end;

scheme :: QC_LANG4:sch 1
ExDecTrees{ F₁() -> non empty set , F₂() -> Element of F₁(), F₃( set ) -> FinSequence of F₁() } :

ex T being finite-branching DecoratedTree of F₁() st
( T . {} = F₂() & ( for t being Element of dom T
for w being Element of F₁() st w = T . t holds
succ T,t = F₃(w) ) )

proof end;

theorem Th16: :: QC_LANG4:16

for T being Tree
for t being Element of T holds ProperPrefixes t is finite Chain of T

proof end;

theorem Th17: :: QC_LANG4:17

for T being Tree holds T -level 0 = {{} }

proof end;

theorem Th18: :: QC_LANG4:18

for n being Nat
for T being Tree holds T -level (n + 1) = union { (succ w) where w is Element of T : len w = n }

proof end;

theorem Th19: :: QC_LANG4:19

for T being finite-branching Tree
for n being Nat holds T -level n is finite

proof end;

theorem Th20: :: QC_LANG4:20

for T being finite-branching Tree holds
( T is finite iff ex n being Nat st T -level n = {} )

proof end;

theorem Th21: :: QC_LANG4:21

for T being finite-branching Tree st not T is finite holds
ex C being Chain of T st not C is finite

proof end;

theorem Th22: :: QC_LANG4:22

for T being finite-branching Tree st not T is finite holds
ex B being Branch of T st not B is finite

proof end;

theorem Th23: :: QC_LANG4:23

for T being Tree
for C being Chain of T
for t being Element of T st t in C & not C is finite holds
ex t' being Element of T st
( t' in C & t is_a_proper_prefix_of t' )

proof end;

theorem Th24: :: QC_LANG4:24

for T being Tree
for B being Branch of T
for t being Element of T st t in B & not B is finite holds
ex t' being Element of T st
( t' in B & t' in succ t )

proof end;

theorem Th25: :: QC_LANG4:25

for f being Function of NAT , NAT st ( for n being Nat holds f . (n + 1) <= f . n ) holds
ex m being Nat st
for n being Nat st m <= n holds
f . n = f . m

proof end;

scheme :: QC_LANG4:sch 2
FinDecTree{ F₁() -> non empty set , F₂() -> finite-branching DecoratedTree of F₁(), F₃( Element of F₁()) -> Nat } :

F₂() is finite

provided

A1: for t, t' being Element of dom F₂()
for d being Element of F₁() st t' in succ t & d = F₂() . t' holds
F₃(d) < F₃((F₂() . t))

proof end;

theorem Th26: :: QC_LANG4:26

for D being non empty set
for T being DecoratedTree of D
for y being set st y in rng T holds
y is Element of D

proof end;

theorem Th27: :: QC_LANG4:27

for D being non empty set
for T being DecoratedTree of D
for x being set st x in dom T holds
T . x is Element of D

proof end;

theorem Th28: :: QC_LANG4:28

for F, G being Element of QC-WFF st F is_subformula_of G holds
len (@ F) <= len (@ G)

proof end;

theorem :: QC_LANG4:29

for F, G being Element of QC-WFF st F is_subformula_of G & len (@ F) = len (@ G) holds
F = G

proof end;

definition

let p be Element of QC-WFF ;
func list_of_immediate_constituents p -> FinSequence of QC-WFF equals :Def1: :: QC_LANG4:def 1
<*> QC-WFF if ( p = VERUM or p is atomic )
<*(the_argument_of p)*> if p is negative
<*(the_left_argument_of p),(the_right_argument_of p)*> if p is conjunctive
otherwise <*(the_scope_of p)*>;
coherence ;
consistency by QC_LANG1:51;

end;

:: deftheorem Def1 defines list_of_immediate_constituents QC_LANG4:def 1 :

theorem Th30: :: QC_LANG4:30

for k being Nat
for F, G being Element of QC-WFF st k in dom (list_of_immediate_constituents F) & G = (list_of_immediate_constituents F) . k holds
G is_immediate_constituent_of F

proof end;

theorem Th31: :: QC_LANG4:31

for F being Element of QC-WFF holds rng (list_of_immediate_constituents F) = { G where G is Element of QC-WFF : G is_immediate_constituent_of F }

proof end;

definition

let p be Element of QC-WFF ;
func tree_of_subformulae p -> finite DecoratedTree of QC-WFF means :Def2: :: QC_LANG4:def 2
( it . {} = p & ( for x being Element of dom it holds succ it,x = list_of_immediate_constituents (it . x) ) );
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def2 defines tree_of_subformulae QC_LANG4:def 2 :

theorem :: QC_LANG4:32

canceled;

theorem :: QC_LANG4:33

canceled;

theorem Th34: :: QC_LANG4:34

for F being Element of QC-WFF holds F in rng (tree_of_subformulae F)

proof end;

theorem Th35: :: QC_LANG4:35

for n being Nat
for F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) st t ^ <*n*> in dom (tree_of_subformulae F) holds
ex G being Element of QC-WFF st
( G = (tree_of_subformulae F) . (t ^ <*n*>) & G is_immediate_constituent_of (tree_of_subformulae F) . t )

proof end;

theorem Th36: :: QC_LANG4:36

for H, F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) holds
( H is_immediate_constituent_of (tree_of_subformulae F) . t iff ex n being Nat st
( t ^ <*n*> in dom (tree_of_subformulae F) & H = (tree_of_subformulae F) . (t ^ <*n*>) ) )

proof end;

theorem Th37: :: QC_LANG4:37

for G, F, H being Element of QC-WFF st G in rng (tree_of_subformulae F) & H is_immediate_constituent_of G holds
H in rng (tree_of_subformulae F)

proof end;

theorem Th38: :: QC_LANG4:38

for G, F, H being Element of QC-WFF st G in rng (tree_of_subformulae F) & H is_subformula_of G holds
H in rng (tree_of_subformulae F)

proof end;

theorem Th39: :: QC_LANG4:39

for G, F being Element of QC-WFF holds
( G in rng (tree_of_subformulae F) iff G is_subformula_of F )

proof end;

theorem :: QC_LANG4:40

for F being Element of QC-WFF holds rng (tree_of_subformulae F) = Subformulae F

proof end;

theorem :: QC_LANG4:41

for F being Element of QC-WFF
for t', t being Element of dom (tree_of_subformulae F) st t' in succ t holds
(tree_of_subformulae F) . t' is_immediate_constituent_of (tree_of_subformulae F) . t

proof end;

theorem Th42: :: QC_LANG4:42

for F being Element of QC-WFF
for t, t' being Element of dom (tree_of_subformulae F) st t is_a_prefix_of t' holds
(tree_of_subformulae F) . t' is_subformula_of (tree_of_subformulae F) . t

proof end;

theorem Th43: :: QC_LANG4:43

for F being Element of QC-WFF
for t, t' being Element of dom (tree_of_subformulae F) st t is_a_proper_prefix_of t' holds
len (@ ((tree_of_subformulae F) . t')) < len (@ ((tree_of_subformulae F) . t))

proof end;

theorem Th44: :: QC_LANG4:44

for F being Element of QC-WFF
for t, t' being Element of dom (tree_of_subformulae F) st t is_a_proper_prefix_of t' holds
(tree_of_subformulae F) . t' <> (tree_of_subformulae F) . t

proof end;

theorem Th45: :: QC_LANG4:45

for F being Element of QC-WFF
for t, t' being Element of dom (tree_of_subformulae F) st t is_a_proper_prefix_of t' holds
(tree_of_subformulae F) . t' is_proper_subformula_of (tree_of_subformulae F) . t

proof end;

theorem :: QC_LANG4:46

for F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) holds
( (tree_of_subformulae F) . t = F iff t = {} )

proof end;

theorem Th47: :: QC_LANG4:47

for F being Element of QC-WFF
for t, t' being Element of dom (tree_of_subformulae F) st t <> t' & (tree_of_subformulae F) . t = (tree_of_subformulae F) . t' holds
not t,t' are_c=-comparable

proof end;

definition

let F, G be Element of QC-WFF ;
func F -entry_points_in_subformula_tree_of G -> AntiChain_of_Prefixes of dom (tree_of_subformulae F) means :Def3: :: QC_LANG4:def 3
for t being Element of dom (tree_of_subformulae F) holds
( t in it iff (tree_of_subformulae F) . t = G );
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def3 defines -entry_points_in_subformula_tree_of QC_LANG4:def 3 :

theorem :: QC_LANG4:48

canceled;

theorem Th49: :: QC_LANG4:49

for F, G being Element of QC-WFF holds F -entry_points_in_subformula_tree_of G = { t where t is Element of dom (tree_of_subformulae F) : (tree_of_subformulae F) . t = G }

proof end;

theorem Th50: :: QC_LANG4:50

for G, F being Element of QC-WFF holds
( G is_subformula_of F iff F -entry_points_in_subformula_tree_of G <> {} )

proof end;

theorem Th51: :: QC_LANG4:51

for m being Nat
for F being Element of QC-WFF
for t', t being Element of dom (tree_of_subformulae F) st t' = t ^ <*m*> & (tree_of_subformulae F) . t is negative holds
( (tree_of_subformulae F) . t' = the_argument_of ((tree_of_subformulae F) . t) & m = 0 )

proof end;

theorem Th52: :: QC_LANG4:52

for m being Nat
for F being Element of QC-WFF
for t', t being Element of dom (tree_of_subformulae F) st t' = t ^ <*m*> & (tree_of_subformulae F) . t is conjunctive & not ( (tree_of_subformulae F) . t' = the_left_argument_of ((tree_of_subformulae F) . t) & m = 0 ) holds
( (tree_of_subformulae F) . t' = the_right_argument_of ((tree_of_subformulae F) . t) & m = 1 )

proof end;

theorem Th53: :: QC_LANG4:53

for m being Nat
for F being Element of QC-WFF
for t', t being Element of dom (tree_of_subformulae F) st t' = t ^ <*m*> & (tree_of_subformulae F) . t is universal holds
( (tree_of_subformulae F) . t' = the_scope_of ((tree_of_subformulae F) . t) & m = 0 )

proof end;

theorem Th54: :: QC_LANG4:54

for F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) st (tree_of_subformulae F) . t is negative holds
( t ^ <*0*> in dom (tree_of_subformulae F) & (tree_of_subformulae F) . (t ^ <*0*>) = the_argument_of ((tree_of_subformulae F) . t) )

proof end;

Lm1: for x, y being set holds dom <*x,y*> = Seg 2

proof end;

theorem Th55: :: QC_LANG4:55

for F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) st (tree_of_subformulae F) . t is conjunctive holds
( t ^ <*0*> in dom (tree_of_subformulae F) & (tree_of_subformulae F) . (t ^ <*0*>) = the_left_argument_of ((tree_of_subformulae F) . t) & t ^ <*1*> in dom (tree_of_subformulae F) & (tree_of_subformulae F) . (t ^ <*1*>) = the_right_argument_of ((tree_of_subformulae F) . t) )

proof end;

theorem Th56: :: QC_LANG4:56

for F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) st (tree_of_subformulae F) . t is universal holds
( t ^ <*0*> in dom (tree_of_subformulae F) & (tree_of_subformulae F) . (t ^ <*0*>) = the_scope_of ((tree_of_subformulae F) . t) )

proof end;

theorem Th57: :: QC_LANG4:57

for F, G, H being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F)
for s being Element of dom (tree_of_subformulae G) st t in F -entry_points_in_subformula_tree_of G & s in G -entry_points_in_subformula_tree_of H holds
t ^ s in F -entry_points_in_subformula_tree_of H

proof end;

theorem Th58: :: QC_LANG4:58

for F, G, H being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F)
for s being FinSequence st t in F -entry_points_in_subformula_tree_of G & t ^ s in F -entry_points_in_subformula_tree_of H holds
s in G -entry_points_in_subformula_tree_of H

proof end;

theorem Th59: :: QC_LANG4:59

for F, G, H being Element of QC-WFF holds { (t ^ s) where t is Element of dom (tree_of_subformulae F), s is Element of dom (tree_of_subformulae G) : ( t in F -entry_points_in_subformula_tree_of G & s in G -entry_points_in_subformula_tree_of H ) } c= F -entry_points_in_subformula_tree_of H

proof end;

theorem Th60: :: QC_LANG4:60

for F being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) holds (tree_of_subformulae F) | t = tree_of_subformulae ((tree_of_subformulae F) . t)

proof end;

theorem Th61: :: QC_LANG4:61

for F, G being Element of QC-WFF
for t being Element of dom (tree_of_subformulae F) holds
( t in F -entry_points_in_subformula_tree_of G iff (tree_of_subformulae F) | t = tree_of_subformulae G )

proof end;

theorem :: QC_LANG4:62

for F, G being Element of QC-WFF holds F -entry_points_in_subformula_tree_of G = { t where t is Element of dom (tree_of_subformulae F) : (tree_of_subformulae F) | t = tree_of_subformulae G }

proof end;

theorem :: QC_LANG4:63

for F, G, H being Element of QC-WFF
for C being Chain of dom (tree_of_subformulae F) st G in { ((tree_of_subformulae F) . t) where t is Element of dom (tree_of_subformulae F) : t in C } & H in { ((tree_of_subformulae F) . t) where t is Element of dom (tree_of_subformulae F) : t in C } & not G is_subformula_of H holds
H is_subformula_of G

proof end;

definition

let F be Element of QC-WFF ;
mode Subformula of F -> Element of QC-WFF means :Def4: :: QC_LANG4:def 4
it is_subformula_of F;
existence ;

end;

:: deftheorem Def4 defines Subformula QC_LANG4:def 4 :

definition

let F be Element of QC-WFF ;
let G be Subformula of F;
mode Entry_Point_in_Subformula_Tree of G -> Element of dom (tree_of_subformulae F) means :Def5: :: QC_LANG4:def 5
(tree_of_subformulae F) . it = G;
existence

proof end;

end;

:: deftheorem Def5 defines Entry_Point_in_Subformula_Tree QC_LANG4:def 5 :

theorem :: QC_LANG4:64

canceled;

theorem :: QC_LANG4:65

for F being Element of QC-WFF
for G being Subformula of F
for t, t' being Entry_Point_in_Subformula_Tree of G st t <> t' holds
not t,t' are_c=-comparable

proof end;

definition

let F be Element of QC-WFF ;
let G be Subformula of F;
func entry_points_in_subformula_tree G -> non empty AntiChain_of_Prefixes of dom (tree_of_subformulae F) equals :: QC_LANG4:def 6
F -entry_points_in_subformula_tree_of G;
coherence

proof end;

end;

:: deftheorem defines entry_points_in_subformula_tree QC_LANG4:def 6 :

theorem :: QC_LANG4:66

canceled;

theorem Th67: :: QC_LANG4:67

for F being Element of QC-WFF
for G being Subformula of F
for t being Entry_Point_in_Subformula_Tree of G holds t in entry_points_in_subformula_tree G

proof end;

theorem Th68: :: QC_LANG4:68

for F being Element of QC-WFF
for G being Subformula of F holds entry_points_in_subformula_tree G = { t where t is Entry_Point_in_Subformula_Tree of G : t = t }

proof end;

theorem Th69: :: QC_LANG4:69

for F being Element of QC-WFF
for G1, G2 being Subformula of F
for t1 being Entry_Point_in_Subformula_Tree of G1
for s being Element of dom (tree_of_subformulae G1) st s in G1 -entry_points_in_subformula_tree_of G2 holds
t1 ^ s is Entry_Point_in_Subformula_Tree of G2

proof end;

theorem :: QC_LANG4:70

for F being Element of QC-WFF
for G2, G1 being Subformula of F
for t1 being Entry_Point_in_Subformula_Tree of G1
for s being FinSequence st t1 ^ s is Entry_Point_in_Subformula_Tree of G2 holds
s in G1 -entry_points_in_subformula_tree_of G2

proof end;

theorem Th71: :: QC_LANG4:71

for F being Element of QC-WFF
for G1, G2 being Subformula of F holds { (t ^ s) where t is Entry_Point_in_Subformula_Tree of G1, s is Element of dom (tree_of_subformulae G1) : s in G1 -entry_points_in_subformula_tree_of G2 } = { (t ^ s) where t is Element of dom (tree_of_subformulae F), s is Element of dom (tree_of_subformulae G1) : ( t in F -entry_points_in_subformula_tree_of G1 & s in G1 -entry_points_in_subformula_tree_of G2 ) }

proof end;

theorem :: QC_LANG4:72

proof end;

theorem :: QC_LANG4:73

for F being Element of QC-WFF
for G1, G2 being Subformula of F st ex t1 being Entry_Point_in_Subformula_Tree of G1 ex t2 being Entry_Point_in_Subformula_Tree of G2 st t1 is_a_prefix_of t2 holds
G2 is_subformula_of G1

proof end;

theorem :: QC_LANG4:74

for F being Element of QC-WFF
for G2, G1 being Subformula of F st G2 is_subformula_of G1 holds
for t1 being Entry_Point_in_Subformula_Tree of G1 ex t2 being Entry_Point_in_Subformula_Tree of G2 st t1 is_a_prefix_of t2

proof end;