-
Notifications
You must be signed in to change notification settings - Fork 3
/
EquivalentStar.v
823 lines (710 loc) · 23.6 KB
/
EquivalentStar.v
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
Require Export SystemFR.CBVNormalizingLemmas.
Require Export SystemFR.FVLemmasEval.
Require Export SystemFR.WFLemmasEval.
Require Export SystemFR.RewriteTactics.
Require Export SystemFR.EqualWithRelation.
Require Export SystemFR.TermLift.
Require Export SystemFR.EquivalenceLemmas.
Require Import Coq.Strings.String.
Require Import Psatz.
Require Import PeanoNat.
Opaque loop.
Opaque makeFresh.
Definition inter_reducible t1 t2: Prop :=
wf t1 0 /\
wf t2 0 /\
is_erased_term t1 /\
is_erased_term t2 /\
(
t1 ~>* t2 \/
t2 ~>* t1
).
Lemma inter_reducible_open:
forall t1 k1 a1 t2 k2 a2,
inter_reducible t1 t2 ->
inter_reducible (open k1 t1 a1) (open k2 t2 a2).
Proof.
unfold inter_reducible;
repeat step || (rewrite open_none in * by eauto with wf lia).
Qed.
Lemma star_inter_reducible:
forall t1 t2,
wf t1 0 ->
is_erased_term t1 ->
t1 ~>* t2 ->
inter_reducible t1 t2.
Proof.
unfold inter_reducible;
steps; eauto with fv wf erased.
Qed.
Lemma star_lift_inter_reducible:
forall t1 t2,
is_erased_term t1 ->
wf t1 0 ->
t1 ~>* t2 ->
term_lift inter_reducible t1 t2.
Proof.
eauto using star_inter_reducible with term_lift.
Qed.
Lemma inter_reducible_sym:
forall t1 t2,
inter_reducible t1 t2 ->
inter_reducible t2 t1.
Proof.
unfold inter_reducible; steps.
Qed.
Lemma inter_reducible_refl:
forall t,
is_erased_term t ->
wf t 0 ->
inter_reducible t t.
Proof.
unfold inter_reducible; steps.
Qed.
Lemma inter_reducible_step:
forall t1 t1' t2,
inter_reducible t1 t2 ->
t1 ~> t1' ->
inter_reducible t1' t2.
Proof.
unfold inter_reducible;
steps;
eauto using star_trans with smallstep star;
try solve [ eapply_anywhere star_one_step2; steps; eauto with smallstep star ];
eauto with fv;
eauto with wf;
eauto with erased.
Qed.
Lemma inter_reducible_value:
forall t v,
inter_reducible t v ->
cbv_value v ->
t ~>* v.
Proof.
induction 1;
repeat step || t_invert_star.
Qed.
Lemma term_lift_inter_reducible_tsize:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
tsize t ~>* build_nat (tsize_semantics v).
Proof.
induction 1;
repeat step || step_inversion cbv_value || list_utils;
eauto using scbv_step_same with star smallstep step_tactic;
eauto 6 using inter_reducible_value, star_trans with cbvlemmas star smallstep.
- repeat (eapply_anywhere star_smallstep_tsize_inv2; [
idtac |
solve [ eauto with values ] |
solve [ eauto ]
]);
repeat step || apply_anywhere build_nat_inj || rewrite_any.
eapply star_trans; eauto with cbvlemmas.
eapply star_trans; eauto with cbvlemmas.
apply smallstep_star.
eapply scbv_step_same.
+ apply SPBetaSize; repeat step || list_utils; eauto with values; eauto with fv.
+ steps.
- repeat (eapply_anywhere star_smallstep_tsize_inv2; [
idtac |
solve [ eauto with values ] |
solve [ eauto ]
]);
repeat step || apply_anywhere build_nat_inj || rewrite_any.
eapply star_trans; eauto with cbvlemmas.
apply smallstep_star.
eapply scbv_step_same.
+ apply SPBetaSize; repeat step || list_utils; eauto with values; eauto with fv.
+ steps.
- repeat (eapply_anywhere star_smallstep_tsize_inv2; [
idtac |
solve [ eauto with values ] |
solve [ eauto ]
]);
repeat step || apply_anywhere build_nat_inj || rewrite_any.
eapply star_trans; eauto with cbvlemmas.
apply smallstep_star.
eapply scbv_step_same.
+ apply SPBetaSize; repeat step || list_utils; eauto with values; eauto with fv.
+ steps.
- repeat (eapply_anywhere star_smallstep_tsize_inv2; [
idtac |
solve [ eauto with values ] |
solve [ eauto ]
]);
repeat step || apply_anywhere build_nat_inj || rewrite_any.
eapply star_trans; eauto with cbvlemmas.
apply smallstep_star.
eapply scbv_step_same.
+ apply SPBetaSize; repeat step || list_utils; eauto with values; eauto with fv.
+ steps.
Qed.
Lemma term_lift_inter_reducible_value:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
exists v',
t ~>* v' /\
cbv_value v' /\
term_lift inter_reducible v v'.
Proof.
induction 1;
repeat step || step_inversion cbv_value;
try solve [ eexists; steps; eauto with smallstep star values; steps;
eauto using term_lift_sym, inter_reducible_sym with term_lift ];
try solve [ eexists; steps; eauto with cbvlemmas values term_lift ];
try solve [ exists (pp v'0 v'); steps; eauto with cbvlemmas values term_lift ].
eexists; steps; eauto using inter_reducible_value.
unfold inter_reducible in *; steps; eauto using term_lift_refl.
Qed.
Ltac term_lift_inter_reducible_value :=
match goal with
| H: term_lift inter_reducible ?t ?v |- _ =>
cbv_value v;
poseNew (Mark H "lift_inter_reducible_value");
unshelve epose proof (term_lift_inter_reducible_value t v H _)
| H: term_lift inter_reducible ?v ?t |- _ =>
cbv_value v;
poseNew (Mark H "lift_inter_reducible_value");
unshelve epose proof (term_lift_inter_reducible_value t v _ _)
end.
Lemma term_lift_inter_reducible_lambda:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
forall t0, t = notype_lambda t0 ->
exists t0', v = notype_lambda t0' /\
term_lift inter_reducible t0 t0'.
Proof.
destruct 1;
repeat step || step_inversion cbv_value; eauto.
pose proof H as CH.
apply_anywhere inter_reducible_value;
repeat step || t_invert_star || top_level_unfold inter_reducible;
eauto using term_lift_refl.
Qed.
Lemma term_lift_inter_reducible_sym:
forall t1 t2,
term_lift inter_reducible t1 t2 ->
term_lift inter_reducible t2 t1.
Proof.
intros; eauto using term_lift_sym, inter_reducible_sym.
Qed.
Lemma term_lift_inter_reducible_pair:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
wf t 0 ->
wf v 0 ->
is_erased_term t ->
is_erased_term v ->
forall t1 t2, t = pp t1 t2 ->
exists v1 v2,
v = pp v1 v2 /\
term_lift inter_reducible t1 v1 /\
term_lift inter_reducible t2 v2.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
eexists; eexists; steps;
try solve [ constructor; unfold inter_reducible; steps; eauto with fv ].
Qed.
Lemma term_lift_inter_reducible_true:
forall t v,
term_lift inter_reducible t v ->
t = ttrue ->
cbv_value v ->
v = ttrue.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
Qed.
Lemma term_lift_inter_reducible_false:
forall t v,
term_lift inter_reducible t v ->
t = tfalse ->
cbv_value v ->
v = tfalse.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
Qed.
Lemma term_lift_inter_reducible_zero:
forall t v,
term_lift inter_reducible t v ->
t = zero ->
cbv_value v ->
v = zero.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
Qed.
Lemma term_lift_inter_reducible_succ:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
wf t 0 ->
wf v 0 ->
is_erased_term t ->
is_erased_term v ->
forall t', t = succ t' ->
exists v',
v = succ v' /\
term_lift inter_reducible t' v'.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
eexists; steps;
try solve [ constructor; unfold inter_reducible; steps; eauto with fv ].
Qed.
Ltac succ_build_nat :=
match goal with
| H: succ _ = build_nat ?n |- _ => is_var n; destruct n
end.
Lemma term_lift_inter_reducible_build_nat:
forall v t,
term_lift inter_reducible t v ->
cbv_value v ->
forall n,
t = build_nat n ->
v = build_nat n.
Proof.
induction 1;
repeat step || apply_anywhere inter_reducible_value || star_smallstep_value || succ_build_nat || step_inversion cbv_value;
try solve [destruct n; discriminate];
eauto with values.
Qed.
Lemma term_lift_inter_reducible_build_nat2:
forall v n,
term_lift inter_reducible (build_nat n) v ->
cbv_value v ->
v = build_nat n.
Proof.
eauto using term_lift_inter_reducible_build_nat.
Qed.
Ltac term_lift_inter_reducible_build_nat :=
match goal with
| H1: term_lift inter_reducible (build_nat ?n) ?t, H2: cbv_value ?t |- _ =>
pose proof (term_lift_inter_reducible_build_nat2 t n H1 H2); subst; clear H1
| H1: term_lift inter_reducible ?t (build_nat ?n), H2: cbv_value ?t |- _ =>
apply term_lift_inter_reducible_sym in H1;
pose proof (term_lift_inter_reducible_build_nat2 t n H1 H2); subst; clear H1
end.
Lemma term_lift_inter_reducible_left:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
wf t 0 ->
wf v 0 ->
is_erased_term t ->
is_erased_term v ->
forall t', t = tleft t' ->
exists v',
v = tleft v' /\
term_lift inter_reducible t' v'.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
eexists; steps;
try solve [ constructor; unfold inter_reducible; steps; eauto with fv ].
Qed.
Lemma term_lift_inter_reducible_right:
forall t v,
term_lift inter_reducible t v ->
cbv_value v ->
wf t 0 ->
wf v 0 ->
is_erased_term t ->
is_erased_term v ->
forall t', t = tright t' ->
exists v',
v = tright v' /\
term_lift inter_reducible t' v'.
Proof.
destruct 1;
repeat step || step_inversion cbv_value || list_utils; eauto.
apply_anywhere inter_reducible_value; repeat step || t_invert_star.
eexists; steps;
try solve [ constructor; unfold inter_reducible; steps; eauto with fv ].
Qed.
Ltac invert_lift :=
match goal with
| H: term_lift inter_reducible ?t1 ?t2 |- _ =>
is_var t2; not_var t1; inversion H; clear H
end.
Lemma term_lift_inter_reducible_open:
forall t1 t2,
term_lift inter_reducible t1 t2 ->
forall t1' t2' k,
term_lift inter_reducible t1' t2' ->
term_lift inter_reducible (open k t1 t1') (open k t2 t2')
.
Proof.
induction 1;
repeat step || top_level_unfold inter_reducible ||
(rewrite open_none in * by eauto 2 with wf lia);
try solve [ constructor; unfold inter_reducible; steps ].
Qed.
Lemma term_lift_inter_reducible_topen:
forall T T',
term_lift inter_reducible T T' ->
forall k X X',
term_lift inter_reducible X X' ->
term_lift inter_reducible (topen k T X) (topen k T' X').
Proof.
induction 1; repeat step;
eauto 6 with term_lift;
try solve [
top_level_unfold inter_reducible; repeat step || rewrite topen_none by eauto with twf;
eauto using star_lift_inter_reducible, term_lift_sym, inter_reducible_sym
].
Qed.
Lemma term_lift_inter_reducible_is_pair:
forall v1 v2,
term_lift inter_reducible v1 v2 ->
cbv_value v1 ->
cbv_value v2 ->
is_pair v1 = is_pair v2.
Proof.
induction 1;
repeat step || unfold inter_reducible in * || t_invert_star.
Qed.
Lemma term_lift_inter_reducible_is_lambda:
forall v1 v2,
term_lift inter_reducible v1 v2 ->
cbv_value v1 ->
cbv_value v2 ->
is_lambda v1 = is_lambda v2.
Proof.
induction 1;
repeat step || unfold inter_reducible in * || t_invert_star.
Qed.
Lemma term_lift_inter_reducible_is_succ:
forall v1 v2,
term_lift inter_reducible v1 v2 ->
cbv_value v1 ->
cbv_value v2 ->
is_succ v1 = is_succ v2.
Proof.
induction 1;
repeat step || unfold inter_reducible in * || t_invert_star.
Qed.
Lemma inter_reducible_values:
forall v1 v2,
inter_reducible v1 v2 ->
cbv_value v1 ->
cbv_value v2 ->
v1 = v2.
Proof.
unfold inter_reducible;
repeat step || t_invert_star.
Qed.
Opaque PeanoNat.Nat.leb.
Opaque PeanoNat.Nat.ltb.
Lemma term_lift_inter_reducible_step:
forall t1 t2,
term_lift inter_reducible t1 t2 ->
wf t1 0 ->
wf t2 0 ->
is_erased_term t1 ->
is_erased_term t2 ->
forall t1', t1 ~> t1' ->
exists t2',
term_lift inter_reducible t1' t2' /\
t2 ~>* t2'.
Proof.
induction 1;
repeat step || t_invert_step || instantiate_any || list_utils;
eauto using inter_reducible_step with star smallstep term_lift;
eauto with cbvlemmas term_lift.
all: try solve [
repeat term_lift_inter_reducible_value; steps;
repeat term_lift_inter_reducible_build_nat; steps;
repeat match goal with
| H1: term_lift inter_reducible ttrue ?v, H2: cbv_value ?v |- _ =>
pose proof (term_lift_inter_reducible_true ttrue v H1 eq_refl H2); subst; clear H1
| H1: term_lift inter_reducible tfalse ?v, H2: cbv_value ?v |- _ =>
pose proof (term_lift_inter_reducible_false tfalse v H1 eq_refl H2); subst; clear H1
end;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym;
eexists; split; [
apply term_lift_refl; steps; eauto with erased
| eapply star_trans;
try eapply star_smallstep_binary_primitive; try eassumption;
apply star_one; eapply scbv_step_same; eauto with smallstep erased; steps]
].
- eexists; steps; eauto using term_lift_inter_reducible_tsize, term_lift_sym, inter_reducible_sym.
apply term_lift_refl; eauto with erased.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_lambda in H18; steps.
exists (open 0 t0' v'0); steps; eauto 7 using star_trans with cbvlemmas smallstep;
eauto using term_lift_inter_reducible_open.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
exists (app v' t2'0); steps; eauto using star_trans with cbvlemmas; eauto with term_lift.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
exists (pp v' t2'0); steps; eauto using star_trans with cbvlemmas; eauto with term_lift.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_pair in H13; repeat step || list_utils || step_inversion cbv_value;
eauto with fv; eauto with wf; eauto with erased;
eauto 7 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_pair in H13; repeat step || list_utils || step_inversion cbv_value;
eauto with fv; eauto with wf; eauto with erased;
eauto 7 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
apply_anywhere term_lift_inter_reducible_true; eauto with values; subst.
eexists; split; eauto using star_trans, star_one, star_smallstep_unary_primitive, term_lift_refl with smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
apply_anywhere term_lift_inter_reducible_false; eauto with values; subst.
eexists; split; eauto using star_trans, star_one, star_smallstep_unary_primitive, term_lift_refl with smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eexists; split.
apply LiBinaryPrimitive ; try eassumption.
eauto using star_trans, star_smallstep_binary_primitive_l, star_smallstep_binary_primitive_r.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_true in H20; steps;
eauto 6 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_false in H20; steps;
eauto 6 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
exists (is_pair t); steps; eauto using term_lift_refl with erased.
erewrite term_lift_inter_reducible_is_pair by eauto.
eapply star_trans; eauto with cbvlemmas.
apply star_one; constructor; steps.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
exists (is_succ t); steps; eauto using term_lift_refl with erased.
erewrite term_lift_inter_reducible_is_succ by eauto.
eapply star_trans; eauto with cbvlemmas.
apply star_one; constructor; steps.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
exists (is_lambda t); steps; eauto using term_lift_refl with erased.
erewrite term_lift_inter_reducible_is_lambda by eauto.
eapply star_trans; eauto with cbvlemmas.
apply star_one; constructor; steps.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_zero in H19; steps;
eauto 6 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_succ in H20; repeat step || step_inversion cbv_value;
eauto 6 using star_trans with cbvlemmas smallstep;
eauto with fv; eauto with wf; eauto with erased.
exists (open 0 t3' v'0);
steps;
eauto using term_lift_inter_reducible_open with term_lift;
eauto 6 using star_trans with cbvlemmas smallstep.
- exists (open 0 (open 1 t' zero) (notype_tfix t'));
steps;
eauto using term_lift_inter_reducible_open with term_lift;
eauto 6 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_left in H19; repeat step || step_inversion cbv_value;
eauto 6 using star_trans with cbvlemmas smallstep;
eauto with fv; eauto with wf; eauto with erased.
exists (open 0 t2' v'0);
steps;
eauto using term_lift_inter_reducible_open with term_lift;
eauto 6 using star_trans with cbvlemmas smallstep.
- repeat term_lift_inter_reducible_value; steps;
eauto with values;
eauto using term_lift_sym, inter_reducible_sym.
eapply term_lift_inter_reducible_right in H19; repeat step || step_inversion cbv_value;
eauto 6 using star_trans with cbvlemmas smallstep;
eauto with fv; eauto with wf; eauto with erased.
exists (open 0 t3' v'0);
steps;
eauto using term_lift_inter_reducible_open with term_lift;
eauto 6 using star_trans with cbvlemmas smallstep.
Qed.
Lemma term_lift_inter_reducible_star:
forall t1 t1',
t1 ~>* t1' ->
forall t2,
term_lift inter_reducible t1 t2 ->
wf t1 0 ->
wf t2 0 ->
is_erased_term t1 ->
is_erased_term t2 ->
exists t2',
term_lift inter_reducible t1' t2' /\
t2 ~>* t2'.
Proof.
induction 1; steps;
eauto using term_lift_refl with star.
unshelve epose proof (term_lift_inter_reducible_step _ _ H1 _ _ _ _ _ H);
eauto; repeat step || instantiate_any.
unshelve epose proof (H9 _ _ _ _);
eauto with wf;
eauto with fv;
eauto with erased;
steps;
eauto using star_trans.
Qed.
Lemma term_lift_inter_reducible_normalizing:
forall t1 t2,
scbv_normalizing t1 ->
term_lift inter_reducible t1 t2 ->
wf t1 0 ->
wf t2 0 ->
is_erased_term t1 ->
is_erased_term t2 ->
scbv_normalizing t2.
Proof.
unfold scbv_normalizing; steps.
unshelve epose proof (term_lift_inter_reducible_star _ _ H6 _ H0 _ _ _ _);
steps.
term_lift_inter_reducible_value; steps; eauto using term_lift_sym, inter_reducible_sym;
eauto using star_trans.
Qed.
Lemma term_lift_inter_reducible_equivalent:
forall t1 t2,
term_lift inter_reducible t1 t2 ->
wf t1 0 ->
wf t2 0 ->
is_erased_term t1 ->
is_erased_term t2 ->
pfv t1 term_var = nil ->
pfv t2 term_var = nil ->
[ t1 ≡ t2 ].
Proof.
unfold equivalent_terms;
steps;
eauto with erased wf fv.
- unshelve epose proof (term_lift_inter_reducible_star _ _ H9 (open 0 C t2) _ _ _ _ _);
repeat step;
eauto with wf erased;
eauto using term_lift_inter_reducible_open, term_lift_refl.
term_lift_inter_reducible_value; steps; eauto using inter_reducible_sym, term_lift_sym.
apply_anywhere term_lift_inter_reducible_true; steps; eauto using star_trans.
- unshelve epose proof (term_lift_inter_reducible_star _ _ H9 (open 0 C t1) _ _ _ _ _);
repeat step;
eauto with wf erased;
eauto using term_lift_inter_reducible_open, term_lift_refl, term_lift_sym, inter_reducible_sym.
term_lift_inter_reducible_value; steps; eauto using inter_reducible_sym, term_lift_sym.
apply_anywhere term_lift_inter_reducible_true; steps; eauto using star_trans.
Qed.
Lemma equivalent_star:
forall t1 t2,
is_erased_term t1 ->
wf t1 0 ->
pfv t1 term_var = nil ->
t1 ~>* t2 ->
[ t1 ≡ t2 ].
Proof.
intros.
apply term_lift_inter_reducible_equivalent; steps; eauto with wf erased fv.
constructor.
unfold inter_reducible;
repeat step; eauto with wf erased.
Qed.
Ltac equivalent_star :=
apply equivalent_star; repeat step || list_utils;
try solve [
unfold equivalent_terms in *; repeat step || list_utils;
t_closer
];
eauto using star_trans with cbvlemmas smallstep values.
Lemma term_lift_inter_reducible_size:
forall T1 T2,
term_lift inter_reducible T1 T2 ->
type_nodes T1 = type_nodes T2.
Proof.
induction 1;
repeat step || unfold inter_reducible in * || rewrite type_nodes_term in * by auto.
Qed.
Lemma equivalent_normalizing:
forall t1 t2 v1,
[ t1 ≡ t2 ] ->
t1 ~>* v1 ->
cbv_value v1 ->
exists v2,
[ v1 ≡ v2 ] /\
t2 ~>* v2 /\
cbv_value v2
.
Proof.
intros.
equivalence_instantiate (app (notype_lambda ttrue) (lvar 0 term_var));
steps.
unshelve epose proof (H4 _);
eauto 6 using star_one, scbv_step_same, star_trans with values smallstep cbvlemmas;
repeat step || t_invert_star.
eexists; steps; try eassumption.
eapply equivalent_square; eauto;
try solve [ equivalent_star ].
Qed.
Ltac equivalent_normalizing :=
match goal with
| H1: [ ?t1 ≡ ?t2 ],
H2: ?t1 ~>* ?v1 |- _ =>
poseNew (Mark (H1, H2) "equivalent_normalizing");
unshelve epose proof (equivalent_normalizing _ _ _ H1 H2 _)
end.
Lemma equivalent_value:
forall t v,
[ t ≡ v ] ->
cbv_value v ->
exists v',
[ v' ≡ v ] /\
t ~>* v' /\
cbv_value v'
.
Proof.
intros.
unshelve epose proof (equivalent_normalizing v t v _ _ H0);
repeat step;
eauto using equivalent_sym.
Qed.
Ltac equivalent_value :=
match goal with
| H: [ ?t ≡ ?v ] |- _ =>
cbv_value v;
not_cbv_value t;
poseNew (Mark (t, v) "equivalent_value");
unshelve epose proof (equivalent_value _ _ H _)
| H: [ ?v ≡ ?t ] |- _ =>
cbv_value v;
not_cbv_value t;
poseNew (Mark (t, v) "equivalent_value");
unshelve epose proof (equivalent_value t v _ _)
end.