(* Properties with parallel rst-computation for closures ********************)
lemma fsb_fpbs_trans:
- â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d« →
- â\88\80G2,L2,T2. â\9dªG1,L1,T1â\9d« â\89¥ â\9dªG2,L2,T2â\9d« â\86\92 â\89¥ð\9d\90\92 â\9dªG2,L2,T2â\9d«.
+ â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d© →
+ â\88\80G2,L2,T2. â\9d¨G1,L1,T1â\9d© â\89¥ â\9d¨G2,L2,T2â\9d© â\86\92 â\89¥ð\9d\90\92 â\9d¨G2,L2,T2â\9d©.
#G1 #L1 #T1 #H @(fsb_ind … H) -G1 -L1 -T1
#G1 #L1 #T1 #H1 #IH #G2 #L2 #T2 #H12
elim (fpbs_inv_fpbg … H12) -H12
(* Properties with parallel rst-transition for closures *********************)
lemma fsb_fpb_trans:
- â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d« →
- â\88\80G2,L2,T2. â\9dªG1,L1,T1â\9d« â\89½ â\9dªG2,L2,T2â\9d« â\86\92 â\89¥ð\9d\90\92 â\9dªG2,L2,T2â\9d«.
+ â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d© →
+ â\88\80G2,L2,T2. â\9d¨G1,L1,T1â\9d© â\89½ â\9d¨G2,L2,T2â\9d© â\86\92 â\89¥ð\9d\90\92 â\9d¨G2,L2,T2â\9d©.
/3 width=5 by fsb_fpbs_trans, fpb_fpbs/ qed-.
(* Properties with proper parallel rst-computation for closures *************)
lemma fsb_intro_fpbg:
∀G1,L1,T1.
- (â\88\80G2,L2,T2. â\9dªG1,L1,T1â\9d« > â\9dªG2,L2,T2â\9d« â\86\92 â\89¥ð\9d\90\92 â\9dªG2,L2,T2â\9d«) →
- â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d«.
+ (â\88\80G2,L2,T2. â\9d¨G1,L1,T1â\9d© > â\9d¨G2,L2,T2â\9d© â\86\92 â\89¥ð\9d\90\92 â\9d¨G2,L2,T2â\9d©) →
+ â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d©.
/4 width=1 by fsb_intro, fpbc_fpbg/ qed.
(* Eliminators with proper parallel rst-computation for closures ************)
lemma fsb_ind_fpbg_fpbs (Q:relation3 …):
- (â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d« →
- (â\88\80G2,L2,T2. â\9dªG1,L1,T1â\9d« > â\9dªG2,L2,T2â\9d« → Q G2 L2 T2) →
+ (â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d© →
+ (â\88\80G2,L2,T2. â\9d¨G1,L1,T1â\9d© > â\9d¨G2,L2,T2â\9d© → Q G2 L2 T2) →
Q G1 L1 T1
) →
- â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d« →
- â\88\80G2,L2,T2. â\9dªG1,L1,T1â\9d« â\89¥ â\9dªG2,L2,T2â\9d« → Q G2 L2 T2.
+ â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d© →
+ â\88\80G2,L2,T2. â\9d¨G1,L1,T1â\9d© â\89¥ â\9d¨G2,L2,T2â\9d© → Q G2 L2 T2.
#Q #IH1 #G1 #L1 #T1 #H @(fsb_ind … H) -G1 -L1 -T1
#G1 #L1 #T1 #H1 #IH #G2 #L2 #T2 #H12
@IH1 -IH1
qed-.
lemma fsb_ind_fpbg (Q:relation3 …):
- (â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d« →
- (â\88\80G2,L2,T2. â\9dªG1,L1,T1â\9d« > â\9dªG2,L2,T2â\9d« → Q G2 L2 T2) →
+ (â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d© →
+ (â\88\80G2,L2,T2. â\9d¨G1,L1,T1â\9d© > â\9d¨G2,L2,T2â\9d© → Q G2 L2 T2) →
Q G1 L1 T1
) →
- â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9dªG1,L1,T1â\9d« → Q G1 L1 T1.
+ â\88\80G1,L1,T1. â\89¥ð\9d\90\92 â\9d¨G1,L1,T1â\9d© → Q G1 L1 T1.
#Q #IH #G1 #L1 #T1 #H @(fsb_ind_fpbg_fpbs … H) -H
/3 width=1 by/
qed-.
(* Inversion lemmas with proper parallel rst-computation for closures *******)
lemma fsb_fpbg_refl_false (G) (L) (T):
- â\89¥ð\9d\90\92 â\9dªG,L,Tâ\9d« â\86\92 â\9dªG,L,Tâ\9d« > â\9dªG,L,Tâ\9d« → ⊥.
+ â\89¥ð\9d\90\92 â\9d¨G,L,Tâ\9d© â\86\92 â\9d¨G,L,Tâ\9d© > â\9d¨G,L,Tâ\9d© → ⊥.
#G #L #T #H
@(fsb_ind_fpbg … H) -G -L -T #G1 #L1 #T1 #_ #IH #H
/2 width=5 by/