url
stringclasses
147 values
commit
stringclasses
147 values
file_path
stringlengths
7
101
full_name
stringlengths
1
94
start
stringlengths
6
10
end
stringlengths
6
11
tactic
stringlengths
1
11.2k
state_before
stringlengths
3
2.09M
state_after
stringlengths
6
2.09M
input
stringlengths
73
2.09M
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply congr.coinduction r'
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F) i...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i =>...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
. clear hβ‚‚ intro i x y hβ‚‚ simp only [precongr, map_quot] have hβ‚‚ := h₁ i _ _ hβ‚‚ simp only [destruct, destruct.f] at hβ‚‚ generalize IContainer.M.destruct x = x at * generalize IContainer.M.destruct y = y at * cases x with | mk nx kx => cases y with | mk ny ky => let f i : Quot (r i) β†’ Quot (r' i) := ...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
. apply hβ‚‚
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
clear hβ‚‚
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
intro i x y hβ‚‚
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
simp only [precongr, map_quot]
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
have hβ‚‚ := h₁ i _ _ hβ‚‚
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
simp only [destruct, destruct.f] at hβ‚‚
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
generalize IContainer.M.destruct x = x at *
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝¹ y✝ : IContainer.M (...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
generalize IContainer.M.destruct y = y at *
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝¹ y✝ : IContainer.M (...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝¹ y✝¹ : IContainer.M ...
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
cases x with | mk nx kx => cases y with | mk ny ky => let f i : Quot (r i) β†’ Quot (r' i) := by apply Quot.lift (Quot.lift (Quot.mk (r' _)) _) _ . intro a b h₃ apply Quot.sound simp only rw [Quot.sound h₃] apply hβ‚€ . intro x; apply Quot.inductionOn (motive := _) x; clear x int...
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝¹ y✝¹ : IContainer.M ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
cases y with | mk ny ky => let f i : Quot (r i) β†’ Quot (r' i) := by apply Quot.lift (Quot.lift (Quot.mk (r' _)) _) _ . intro a b h₃ apply Quot.sound simp only rw [Quot.sound h₃] apply hβ‚€ . intro x; apply Quot.inductionOn (motive := _) x; clear x intro x y; apply Quot.inductio...
case a.a.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝¹ : IContainer....
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a.a.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
let f i : Quot (r i) β†’ Quot (r' i) := by apply Quot.lift (Quot.lift (Quot.mk (r' _)) _) _ . intro a b h₃ apply Quot.sound simp only rw [Quot.sound h₃] apply hβ‚€ . intro x; apply Quot.inductionOn (motive := _) x; clear x intro x y; apply Quot.inductionOn (motive := _) y; clear ...
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
Please generate a tactic in lean4 to solve the state. STATE: case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
have : βˆ€ i, f i ∘ Quot.mk (r _) ∘ Quot.mk (congr F _) = Quot.mk (r' _) := by intro i; rfl
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
Please generate a tactic in lean4 to solve the state. STATE: case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
conv => congr . rhs lhs intro i rw [←this] rfl . rhs lhs intro i rw [←this]
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
Please generate a tactic in lean4 to solve the state. STATE: case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
rw [IContainer.Map_spec, IContainer.Map_spec, IContainer.Map_spec, IContainer.Map_spec]
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
Please generate a tactic in lean4 to solve the state. STATE: case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
rw [inst.abs_imap, inst.abs_imap, inst.abs_imap, inst.abs_imap, inst.abs_imap, inst.abs_imap, hβ‚‚]
case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContaine...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a.a.mk.mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply Quot.lift (Quot.lift (Quot.mk (r' _)) _) _
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
. intro a b h₃ apply Quot.sound simp only rw [Quot.sound h₃] apply hβ‚€
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
. intro x; apply Quot.inductionOn (motive := _) x; clear x intro x y; apply Quot.inductionOn (motive := _) y; clear y intro y h apply Quot.sound apply h
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
intro a b h₃
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply Quot.sound
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
simp only
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C ...
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C ...
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i =>...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
rw [Quot.sound h₃]
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C ...
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C ...
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i =>...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply hβ‚€
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i =>...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
intro x
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝ : IContainer.M (C F) i✝¹...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply Quot.inductionOn (motive := _) x
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝ : IContainer.M (C F) i✝¹...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝ : IContainer.M (C F) i✝¹...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
clear x
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝ : IContainer.M (C F) i✝¹...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
intro x y
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (C F) i✝...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply Quot.inductionOn (motive := _) y
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (C F) i✝...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (C F) i✝...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
clear y
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (C F) i✝...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝ : IContainer.M (C F) i✝¹...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
intro y h
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝ : IContainer.M (C F) i✝¹...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (C F) i✝...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply Quot.sound
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (C F) i✝...
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply h
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝¹ y✝¹ : IContainer.M (...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i =>...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
intro i
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝ : I x✝ y✝ : IContainer.M (C F) i✝ r'...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
rfl
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i✝¹ : I x✝ y✝ : IContainer.M (C F) i✝¹ ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.m...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim_lemma
[131, 1]
[183, 13]
apply hβ‚‚
case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i => Quot.mk (r i)) (destruct y) i : I x y : IContainer.M (C F)...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x : M F i), r i x x h₁ : βˆ€ (i : I) (x y : M F i), r i x y β†’ IFunctor.imap (fun i => Quot.mk (r i)) (destruct x) = IFunctor.imap (fun i ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
intro i x y h₁
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) ⊒ βˆ€ {i : I} (x y : M F i), r i x y β†’ x = y
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) ⊒ βˆ€ {i : I} (x y : M F i), r i x y β†’ x = y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
apply bisim_lemma (λ i x y => x = y ∨ r i x y)
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y
case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x : M F i), x = x ∨ r i x x case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
. intro _ _ left rfl
case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x : M F i), x = x ∨ r i x x case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r ...
case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x y : M F i), x = y ∨ r i x y β†’ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i ...
Please generate a tactic in lean4 to solve the state. STATE: case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x : M F i), x = x ∨ r i x x case h₁...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
. intro i x y hβ‚‚ cases hβ‚‚ case inl hβ‚‚ => rw [hβ‚‚] case inr hβ‚‚ => have ⟨z, hβ‚ƒβŸ© := hβ‚€ _ _ _ hβ‚‚ clear hβ‚‚ rw [←h₃.1, ←h₃.2] clear h₃ rw [←imap_spec, ←imap_spec] conv => congr <;> rw [←abs_repr z] rw [←abs_imap] rw [←abs_imap] cases repr z with | mk nz kz => simp only [...
case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x y : M F i), x = y ∨ r i x y β†’ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i ...
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y ∨ r i x y
Please generate a tactic in lean4 to solve the state. STATE: case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x y : M F i), x = y ∨ r i x y β†’ ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
. right; assumption
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y ∨ r i x y
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y ∨ r i x y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
intro _ _
case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x : M F i), x = x ∨ r i x x
case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y i✝ : I x✝ : M F i✝ ⊒ x✝ = x✝ ∨ r i✝ x✝ x✝
Please generate a tactic in lean4 to solve the state. STATE: case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x : M F i), x = x ∨ r i x x TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
left
case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y i✝ : I x✝ : M F i✝ ⊒ x✝ = x✝ ∨ r i✝ x✝ x✝
case hβ‚€.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y i✝ : I x✝ : M F i✝ ⊒ x✝ = x✝
Please generate a tactic in lean4 to solve the state. STATE: case hβ‚€ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y i✝ : I x✝ : M F i✝ ⊒ x✝ = x✝ ∨ r i✝ x✝ x✝ TACTIC:...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rfl
case hβ‚€.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y i✝ : I x✝ : M F i✝ ⊒ x✝ = x✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hβ‚€.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y i✝ : I x✝ : M F i✝ ⊒ x✝ = x✝ TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
intro i x y hβ‚‚
case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x y : M F i), x = y ∨ r i x y β†’ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i ...
case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ∨ r i x y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (d...
Please generate a tactic in lean4 to solve the state. STATE: case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ βˆ€ (i : I) (x y : M F i), x = y ∨ r i x y β†’ ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
cases hβ‚‚
case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ∨ r i x y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (d...
case h₁.inl I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i h✝ : x = y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (destruc...
Please generate a tactic in lean4 to solve the state. STATE: case h₁ I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ∨ r i x y ⊒ I...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
case inl hβ‚‚ => rw [hβ‚‚]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (destruct x) = I...
no goals
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ⊒ IFunctor.imap (fun ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
case inr hβ‚‚ => have ⟨z, hβ‚ƒβŸ© := hβ‚€ _ _ _ hβ‚‚ clear hβ‚‚ rw [←h₃.1, ←h₃.2] clear h₃ rw [←imap_spec, ←imap_spec] conv => congr <;> rw [←abs_repr z] rw [←abs_imap] rw [←abs_imap] cases repr z with | mk nz kz => simp only [IContainer.Map, Function.comp] apply congrArg abs rw [Sigma.mk.inj_iff] sim...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (destruct x) = ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y ⊒ IFunctor.imap (fu...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rw [hβ‚‚]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (destruct x) = I...
no goals
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : x = y ⊒ IFunctor.imap (fun ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
have ⟨z, hβ‚ƒβŸ© := hβ‚€ _ _ _ hβ‚‚
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = y ∨ r i x y) (destruct x) = ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y z : F (fun i => { p // r i p.fst p.snd }) i h₃ : IFunctor.imap (fun x x_1 => (↑x...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y ⊒ IFunctor.imap (fu...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
clear hβ‚‚
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y z : F (fun i => { p // r i p.fst p.snd }) i h₃ : IFunctor.imap (fun x x_1 => (↑x...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i h₃ : IFunctor.imap (fun x x_1 => (↑x_1).fst) z = ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i hβ‚‚ : r i x y z : F (fun i => { p...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rw [←h₃.1, ←h₃.2]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i h₃ : IFunctor.imap (fun x x_1 => (↑x_1).fst) z = ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i h₃ : IFunctor.imap (fun x x_1 => (↑x_1).fst) z = ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
clear h₃
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i h₃ : IFunctor.imap (fun x x_1 => (↑x_1).fst) z = ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rw [←imap_spec, ←imap_spec]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ IFunctor.imap (fun i => Quot.mk fun x y => x = ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ IFunctor.imap (fun i => (Quot.mk fun x y => x =...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
conv => congr <;> rw [←abs_repr z]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ IFunctor.imap (fun i => (Quot.mk fun x y => x =...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ IFunctor.imap (fun i => (Quot.mk fun x y => x =...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rw [←abs_imap]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ IFunctor.imap (fun i => (Quot.mk fun x y => x =...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ abs (IContainer.Map (fun i => (Quot.mk fun x y ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rw [←abs_imap]
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ abs (IContainer.Map (fun i => (Quot.mk fun x y ...
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ abs (IContainer.Map (fun i => (Quot.mk fun x y ...
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
cases repr z with | mk nz kz => simp only [IContainer.Map, Function.comp] apply congrArg abs rw [Sigma.mk.inj_iff] simp only [true_and, heq_eq_eq] funext a apply Quot.sound right apply (kz a).2
I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i ⊒ abs (IContainer.Map (fun i => (Quot.mk fun x y ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
simp only [IContainer.Map, Function.comp]
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
Please generate a tactic in lean4 to solve the state. STATE: case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
apply congrArg abs
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
Please generate a tactic in lean4 to solve the state. STATE: case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
rw [Sigma.mk.inj_iff]
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
Please generate a tactic in lean4 to solve the state. STATE: case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
simp only [true_and, heq_eq_eq]
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
Please generate a tactic in lean4 to solve the state. STATE: case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
funext a
case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICont...
case mk.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICo...
Please generate a tactic in lean4 to solve the state. STATE: case mk I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
apply Quot.sound
case mk.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : ICo...
case mk.h.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : I...
Please generate a tactic in lean4 to solve the state. STATE: case mk.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p //...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
right
case mk.h.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y : I...
case mk.h.a.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y :...
Please generate a tactic in lean4 to solve the state. STATE: case mk.h.a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
apply (kz a).2
case mk.h.a.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { p // r i p.fst p.snd }) i nz : IContainer.A (C F) i kz : (y :...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case mk.h.a.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i✝ : I x✝ y✝ : M F i✝ h₁ : r i✝ x✝ y✝ i : I x y : M F i z : F (fun i => { ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
right
case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y ∨ r i x y
case a.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ r i x y
Please generate a tactic in lean4 to solve the state. STATE: case a I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ x = y ∨ r i x y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/MIdx.lean
IQPF.M.bisim
[185, 1]
[216, 22]
assumption
case a.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ r i x y
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a.h I : Type u₁ F : (I β†’ Type u₁) β†’ I β†’ Type u₁ inst : IQPF F r : (i : I) β†’ M F i β†’ M F i β†’ Prop hβ‚€ : βˆ€ (i : I) (x y : M F i), r i x y β†’ liftr F r i (destruct x) (destruct y) i : I x y : M F i h₁ : r i x y ⊒ r i x y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
intro hβ‚€ x y h₁
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop ⊒ (βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y) β†’ βˆ€ (x y : M (C F)), p x y β†’ congr F x y
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y ⊒ congr F x y
Please generate a tactic in lean4 to solve the state. STATE: F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop ⊒ (βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y) β†’ βˆ€ (x y : M (C F)), p x y β†’ congr F x y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
simp only [congr, pcongr]
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y ⊒ congr F x y
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y ⊒ ↑(pgfp (precongr F)) βŠ₯ x y
Please generate a tactic in lean4 to solve the state. STATE: F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y ⊒ congr F x y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
have := (pgfp.coinduction (precongr F) p).2
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y ⊒ ↑(pgfp (precongr F)) βŠ₯ x y
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ ↑(pgfp (precongr F)) βŠ₯ x y
Please generate a tactic in lean4 to solve the state. STATE: F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y ⊒ ↑(pgfp (precongr F)) βŠ₯ x y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
apply this
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ ↑(pgfp (precongr F)) βŠ₯ x y
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) c...
Please generate a tactic in lean4 to solve the state. STATE: F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F))...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
have : p ≀ p βŠ” pgfp (precongr F) p := by simp
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) c...
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ this : p ≀ p βŠ” ↑(pgfp (precongr F)) p ⊒ p ≀ ↑(prec...
Please generate a tactic in lean4 to solve the state. STATE: case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (preco...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
have := (precongr F).2 this
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ this : p ≀ p βŠ” ↑(pgfp (precongr F)) p ⊒ p ≀ ↑(prec...
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝¹ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ this✝ : p ≀ p βŠ” ↑(pgfp (precongr F)) p this : ↑(p...
Please generate a tactic in lean4 to solve the state. STATE: case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (prec...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
apply le_trans _ this
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝¹ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ this✝ : p ≀ p βŠ” ↑(pgfp (precongr F)) p this : ↑(p...
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝¹ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ this✝ : p ≀ p βŠ” ↑(pgfp (precongr F)) p this : ↑(precongr...
Please generate a tactic in lean4 to solve the state. STATE: case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝¹ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (pre...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
apply hβ‚€
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝¹ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ this✝ : p ≀ p βŠ” ↑(pgfp (precongr F)) p this : ↑(precongr...
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ p x y
Please generate a tactic in lean4 to solve the state. STATE: F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this✝¹ : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
assumption
case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ p x y
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (preco...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.congr.coinduction
[56, 1]
[67, 13]
simp
F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F)) βŠ₯ ⊒ p ≀ p βŠ” ↑(pgfp (precongr F)) p
no goals
Please generate a tactic in lean4 to solve the state. STATE: F✝ : Type u₁ β†’ Type u₁ inst✝ : QPF F✝ F : Type u₁ β†’ Type u₁ inst : QPF F p : M (C F) β†’ M (C F) β†’ Prop hβ‚€ : βˆ€ (x y : M (C F)), p x y β†’ ↑(precongr F) p x y x y : M (C F) h₁ : p x y this : p ≀ ↑(precongr F) (p βŠ” ↑(pgfp (precongr F)) p) β†’ p ≀ ↑(pgfp (precongr F))...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.destruct_corec
[98, 1]
[105, 8]
simp only [destruct, corec, destruct.f, Container.M.destruct_corec, inst.abs_map, inst.abs_repr]
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ destruct (corec f xβ‚€) = (fun x => corec f x) <$> f xβ‚€
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> f xβ‚€ = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> f xβ‚€
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ destruct (corec f xβ‚€) = (fun x => corec f x) <$> f xβ‚€ TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.destruct_corec
[98, 1]
[105, 8]
rw [←inst.abs_repr (f xβ‚€)]
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> f xβ‚€ = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> f xβ‚€
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> abs (repr (f xβ‚€)) = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> abs (repr (f xβ‚€))
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> f xβ‚€ = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> f xβ‚€ TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.destruct_corec
[98, 1]
[105, 8]
cases repr (f xβ‚€) with | mk n k => simp only [←inst.abs_map, Container.Map] rfl
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> abs (repr (f xβ‚€)) = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> abs (repr (f xβ‚€))
no goals
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> abs (repr (f xβ‚€)) = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> abs (repr (...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.destruct_corec
[98, 1]
[105, 8]
simp only [←inst.abs_map, Container.Map]
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± n : (C F).A k : Container.B (C F) n β†’ Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> abs { fst := n, snd := k } = (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) <$> abs { fst := n,...
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± n : (C F).A k : Container.B (C F) n β†’ Ξ± ⊒ abs { fst := n, snd := (fun x => Quot.mk (congr F) x) ∘ (Container.M.corec fun x => repr (f x)) ∘ k } = abs { fst := n, snd := (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) ...
Please generate a tactic in lean4 to solve the state. STATE: case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± n : (C F).A k : Container.B (C F) n β†’ Ξ± ⊒ (fun x => Quot.mk (congr F) x) <$> (Container.M.corec fun x => repr (f x)) <$> abs { fst := n, snd := k } = (fun x => Quot.mk (congr F) (Co...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.destruct_corec
[98, 1]
[105, 8]
rfl
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± n : (C F).A k : Container.B (C F) n β†’ Ξ± ⊒ abs { fst := n, snd := (fun x => Quot.mk (congr F) x) ∘ (Container.M.corec fun x => repr (f x)) ∘ k } = abs { fst := n, snd := (fun x => Quot.mk (congr F) (Container.M.corec (fun x => repr (f x)) x)) ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± : Type u₁ f : Ξ± β†’ F Ξ± xβ‚€ : Ξ± n : (C F).A k : Container.B (C F) n β†’ Ξ± ⊒ abs { fst := n, snd := (fun x => Quot.mk (congr F) x) ∘ (Container.M.corec fun x => repr (f x)) ∘ k } = abs { fst := n, snd := (fun x => Qu...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.map_comp
[119, 1]
[126, 6]
conv => congr <;> rw [←inst.abs_repr x]
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± ⊒ (f ∘ g) <$> x = f <$> g <$> x
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± ⊒ (f ∘ g) <$> abs (repr x) = f <$> g <$> abs (repr x)
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± ⊒ (f ∘ g) <$> x = f <$> g <$> x TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.map_comp
[119, 1]
[126, 6]
cases repr x
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± ⊒ (f ∘ g) <$> abs (repr x) = f <$> g <$> abs (repr x)
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± fst✝ : (C F).A snd✝ : Container.B (C F) fst✝ β†’ Ξ± ⊒ (f ∘ g) <$> abs { fst := fst✝, snd := snd✝ } = f <$> g <$> abs { fst := fst✝, snd := snd✝ }
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± ⊒ (f ∘ g) <$> abs (repr x) = f <$> g <$> abs (repr x) TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.map_comp
[119, 1]
[126, 6]
simp [←inst.abs_map, Container.Map]
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± fst✝ : (C F).A snd✝ : Container.B (C F) fst✝ β†’ Ξ± ⊒ (f ∘ g) <$> abs { fst := fst✝, snd := snd✝ } = f <$> g <$> abs { fst := fst✝, snd := snd✝ }
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± fst✝ : (C F).A snd✝ : Container.B (C F) fst✝ β†’ Ξ± ⊒ abs { fst := fst✝, snd := (f ∘ g) ∘ snd✝ } = abs { fst := fst✝, snd := f ∘ g ∘ snd✝ }
Please generate a tactic in lean4 to solve the state. STATE: case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± fst✝ : (C F).A snd✝ : Container.B (C F) fst✝ β†’ Ξ± ⊒ (f ∘ g) <$> abs { fst := fst✝, snd := snd✝ } = f <$> g <$> abs { fst := fst✝, snd := snd✝ } TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.map_comp
[119, 1]
[126, 6]
rfl
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± fst✝ : (C F).A snd✝ : Container.B (C F) fst✝ β†’ Ξ± ⊒ abs { fst := fst✝, snd := (f ∘ g) ∘ snd✝ } = abs { fst := fst✝, snd := f ∘ g ∘ snd✝ }
no goals
Please generate a tactic in lean4 to solve the state. STATE: case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : F Ξ± fst✝ : (C F).A snd✝ : Container.B (C F) fst✝ β†’ Ξ± ⊒ abs { fst := fst✝, snd := (f ∘ g) ∘ snd✝ } = abs { fst := fst✝, snd := f ∘ g ∘ snd✝ } TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
Container.Map_spec
[129, 1]
[133, 6]
cases x
F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : Obj (QPF.C F) Ξ± ⊒ Map (f ∘ g) x = Map f (Map g x)
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² fst✝ : (QPF.C F).A snd✝ : B (QPF.C F) fst✝ β†’ Ξ± ⊒ Map (f ∘ g) { fst := fst✝, snd := snd✝ } = Map f (Map g { fst := fst✝, snd := snd✝ })
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² x : Obj (QPF.C F) Ξ± ⊒ Map (f ∘ g) x = Map f (Map g x) TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
Container.Map_spec
[129, 1]
[133, 6]
simp [Map]
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² fst✝ : (QPF.C F).A snd✝ : B (QPF.C F) fst✝ β†’ Ξ± ⊒ Map (f ∘ g) { fst := fst✝, snd := snd✝ } = Map f (Map g { fst := fst✝, snd := snd✝ })
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² fst✝ : (QPF.C F).A snd✝ : B (QPF.C F) fst✝ β†’ Ξ± ⊒ (f ∘ g) ∘ snd✝ = f ∘ g ∘ snd✝
Please generate a tactic in lean4 to solve the state. STATE: case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² fst✝ : (QPF.C F).A snd✝ : B (QPF.C F) fst✝ β†’ Ξ± ⊒ Map (f ∘ g) { fst := fst✝, snd := snd✝ } = Map f (Map g { fst := fst✝, snd := snd✝ }) TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
Container.Map_spec
[129, 1]
[133, 6]
rfl
case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² fst✝ : (QPF.C F).A snd✝ : B (QPF.C F) fst✝ β†’ Ξ± ⊒ (f ∘ g) ∘ snd✝ = f ∘ g ∘ snd✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case mk F : Type u₁ β†’ Type u₁ inst : QPF F Ξ± Ξ² Ξ³ : Type u₁ f : Ξ² β†’ Ξ³ g : Ξ± β†’ Ξ² fst✝ : (QPF.C F).A snd✝ : B (QPF.C F) fst✝ β†’ Ξ± ⊒ (f ∘ g) ∘ snd✝ = f ∘ g ∘ snd✝ TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
intro x
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y ⊒ βˆ€ (x y : M F), r x y β†’ x = y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : M F ⊒ βˆ€ (y : M F), r x y β†’ x = y
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y ⊒ βˆ€ (x y : M F), r x y β†’ x = y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
apply Quot.inductionOn (motive := _) x
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : M F ⊒ βˆ€ (y : M F), r x y β†’ x = y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : M F ⊒ βˆ€ (a : Container.M (C F)) (y : M F), r (Quot.mk (congr F) a) y β†’ Quot.mk (congr F) a = y
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : M F ⊒ βˆ€ (y : M F), r x y β†’ x = y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
clear x
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : M F ⊒ βˆ€ (a : Container.M (C F)) (y : M F), r (Quot.mk (congr F) a) y β†’ Quot.mk (congr F) a = y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y ⊒ βˆ€ (a : Container.M (C F)) (y : M F), r (Quot.mk (congr F) a) y β†’ Quot.mk (congr F) a = y
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : M F ⊒ βˆ€ (a : Container.M (C F)) (y : M F), r (Quot.mk (congr F) a) y β†’ Quot.mk (congr F) a = y ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
intro x y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y ⊒ βˆ€ (a : Container.M (C F)) (y : M F), r (Quot.mk (congr F) a) y β†’ Quot.mk (congr F) a = y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) y : M F ⊒ r (Quot.mk (congr F) x) y β†’ Quot.mk (congr F) x = y
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y ⊒ βˆ€ (a : Container.M (C F)) (y : M F), r (Quot.mk (congr F) a) y β†’ Quot.mk (congr F) a = y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
apply Quot.inductionOn (motive := _) y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) y : M F ⊒ r (Quot.mk (congr F) x) y β†’ Quot.mk (congr F) x = y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) y : M F ⊒ βˆ€ (a : Container.M (C F)), r (Quot.mk (congr F) x) (Quot.mk (congr F) a) β†’ Quot.mk (congr F) x = Quot.mk (congr F) a
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) y : M F ⊒ r (Quot.mk (congr F) x) y β†’ Quot.mk (congr F) x = y TACTIC:
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
clear y
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) y : M F ⊒ βˆ€ (a : Container.M (C F)), r (Quot.mk (congr F) x) (Quot.mk (congr F) a) β†’ Quot.mk (congr F) x = Quot.mk (congr F) a
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) ⊒ βˆ€ (a : Container.M (C F)), r (Quot.mk (congr F) x) (Quot.mk (congr F) a) β†’ Quot.mk (congr F) x = Quot.mk (congr F) a
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) y : M F ⊒ βˆ€ (a : Container.M (C F)), r (Quot.mk (congr F) x) (Quot.mk (congr ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
intro y hβ‚‚
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) ⊒ βˆ€ (a : Container.M (C F)), r (Quot.mk (congr F) x) (Quot.mk (congr F) a) β†’ Quot.mk (congr F) x = Quot.mk (congr F) a
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) ⊒ Quot.mk (congr F) x = Quot.mk (congr F) y
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x : Container.M (C F) ⊒ βˆ€ (a : Container.M (C F)), r (Quot.mk (congr F) x) (Quot.mk (congr F) a) β†’ ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
apply Quot.sound
F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) ⊒ Quot.mk (congr F) x = Quot.mk (congr F) y
case a F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) ⊒ congr F x y
Please generate a tactic in lean4 to solve the state. STATE: F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) ⊒ Quot.mk (congr F) x = ...
https://github.com/RemyCiterin/LeanCoInd.git
69d305ae769624f460f9c1ee6a0351917f4b74cf
CoInd/QPF/M.lean
QPF.M.bisim_lemma
[135, 1]
[187, 13]
let r' x y := r (Quot.mk _ x) (Quot.mk _ y)
case a F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) ⊒ congr F x y
case a F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) r' : Container.M (C F) β†’ Container.M (C F) β†’ Prop := fun x y => r (Quot.mk (co...
Please generate a tactic in lean4 to solve the state. STATE: case a F : Type u₁ β†’ Type u₁ inst : QPF F r : M F β†’ M F β†’ Prop hβ‚€ : βˆ€ (x : M F), r x x h₁ : βˆ€ (x y : M F), r x y β†’ Quot.mk r <$> destruct x = Quot.mk r <$> destruct y x y : Container.M (C F) hβ‚‚ : r (Quot.mk (congr F) x) (Quot.mk (congr F) y) ⊒ congr F x y TAC...