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
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
let F := def_ X xs
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName h1 : ↑(def_ X xs).primeSet βŠ† Ξ”_U ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName h1 : ↑(def_ X xs).primeSet βŠ† Ξ”_U F : Formula := def_ X xs ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
simp only [Formula.primeSet] at h1
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName h1 : ↑(def_ X xs).primeSet βŠ† Ξ”_U F : Formula := def_ X xs ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName h1 : ↑{def_ X xs} βŠ† Ξ”_U F : Formula := def_ X xs ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
simp at h1
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName h1 : ↑{def_ X xs} βŠ† Ξ”_U F : Formula := def_ X xs ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
simp only [evalPrimeFfToNot]
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (def_ X xs))
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ IsDeduct ((fun a => if evalPrime V a then a else a.not_) '' Ξ”_U) (if evalPrime V (def_ X xs) then def_ X xs else (def_ X xs).not_)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
simp only [Formula.evalPrime]
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ IsDeduct ((fun a => if evalPrime V a then a else a.not_) '' Ξ”_U) (if evalPrime V (def_ X xs) then def_ X xs else (def_ X xs).not_)
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ IsDeduct ((fun a => if evalPrime V a then a else a.not_) '' Ξ”_U) (if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
apply IsDeduct.assume_
Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ IsDeduct ((fun a => if evalPrime V a then a else a.not_) '' Ξ”_U) (if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_)
case a Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ (if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_) ∈ (fun a => if evalPrime V a then a else a.not_) '' Ξ”_U
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
simp
case a Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ (if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_) ∈ (fun a => if evalPrime V a then a else a.not_) '' Ξ”_U
case a Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ βˆƒ x ∈ Ξ”_U, (if evalPrime V x then x else x.not_) = if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
apply Exists.intro F
case a Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ βˆƒ x ∈ Ξ”_U, (if evalPrime V x then x else x.not_) = if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_
case a Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ F ∈ Ξ”_U ∧ (if evalPrime V F then F else F.not_) = if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
tauto
case a Ξ”_U : Set Formula V : VarBoolAssignment X : DefName xs : List VarName F : Formula := def_ X xs h1 : def_ X xs ∈ Ξ”_U ⊒ F ∈ Ξ”_U ∧ (if evalPrime V F then F else F.not_) = if V (def_ X xs) = true then def_ X xs else (def_ X xs).not_
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.L_15_7
[773, 1]
[916, 10]
sorry
Ξ”_U : Set Formula V : VarBoolAssignment a✝¹ : VarName a✝ : Formula a_ih✝ : ↑a✝.primeSet βŠ† Ξ”_U β†’ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V a✝) h1 : ↑(exists_ a✝¹ a✝).primeSet βŠ† Ξ”_U ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”_U) (evalPrimeFfToNot V (exists_ a✝¹ a✝))
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
apply IsDeduct.mp_ (U.not_.imp_ P)
P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” P
case a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” ((U.not_.imp_ P).imp_ P) case a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” (U.not_.imp_ P)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
apply IsDeduct.mp_ (U.imp_ P)
case a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” ((U.not_.imp_ P).imp_ P)
case a.a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” ((U.imp_ P).imp_ ((U.not_.imp_ P).imp_ P)) case a.a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” (U.imp_ P)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
apply proof_imp_deduct
case a.a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” ((U.imp_ P).imp_ ((U.not_.imp_ P).imp_ P))
case a.a.h1 P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsProof ((U.imp_ P).imp_ ((U.not_.imp_ P).imp_ P))
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
apply T_14_9
case a.a.h1 P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsProof ((U.imp_ P).imp_ ((U.not_.imp_ P).imp_ P))
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
apply deduction_theorem
case a.a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” (U.imp_ P)
case a.a.h1 P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct (Ξ” βˆͺ {U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
exact h1
case a.a.h1 P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct (Ξ” βˆͺ {U}) P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
apply deduction_theorem
case a P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct Ξ” (U.not_.imp_ P)
case a.h1 P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct (Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.T_14_9_Deduct
[919, 1]
[933, 13]
exact h2
case a.h1 P U : Formula Ξ” : Set Formula h1 : IsDeduct (Ξ” βˆͺ {U}) P h2 : IsDeduct (Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct (Ξ” βˆͺ {U.not_}) P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
induction F
F F' : Formula V : VarBoolAssignment h1 : F.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) F = Function.updateITE (evalPrimeFfToNot V) F' F F
case pred_const_ F' : Formula V : VarBoolAssignment a✝¹ : PredName a✝ : List VarName h1 : (pred_const_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (pred_const_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (pred_const_ a✝¹ a✝) (pred_const_ a✝¹ a✝) case pred_var_ F' : Formula V : VarBoolAssignment a✝¹ : PredName a✝ : List VarName h1 : (pred_var_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (pred_var_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (pred_var_ a✝¹ a✝) (pred_var_ a✝¹ a✝) case eq_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : VarName h1 : (eq_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (eq_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (eq_ a✝¹ a✝) (eq_ a✝¹ a✝) case true_ F' : Formula V : VarBoolAssignment h1 : true_.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) true_ = Function.updateITE (evalPrimeFfToNot V) F' true_ true_ case false_ F' : Formula V : VarBoolAssignment h1 : false_.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) false_ = Function.updateITE (evalPrimeFfToNot V) F' false_ false_ case not_ F' : Formula V : VarBoolAssignment a✝ : Formula a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : a✝.not_.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) a✝.not_ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝.not_ case imp_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (a✝¹.imp_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (a✝¹.imp_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.imp_ a✝) (a✝¹.imp_ a✝) case and_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (a✝¹.and_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (a✝¹.and_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.and_ a✝) (a✝¹.and_ a✝) case or_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (a✝¹.or_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (a✝¹.or_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.or_ a✝) (a✝¹.or_ a✝) case iff_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (a✝¹.iff_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (a✝¹.iff_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.iff_ a✝) (a✝¹.iff_ a✝) case forall_ F' : Formula V : VarBoolAssignment a✝¹ : VarName a✝ : Formula a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (forall_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (forall_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (forall_ a✝¹ a✝) (forall_ a✝¹ a✝) case exists_ F' : Formula V : VarBoolAssignment a✝¹ : VarName a✝ : Formula a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (exists_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (exists_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (exists_ a✝¹ a✝) (exists_ a✝¹ a✝) case def_ F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (def_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (def_ a✝¹ a✝) (def_ a✝¹ a✝)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
case pred_const_ | pred_var_ | eq_ | forall_ | exists_ | def_ => unfold Function.updateITE simp only [evalPrimeFfToNot] simp only [Formula.evalPrime] split_ifs <;> tauto
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (def_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (def_ a✝¹ a✝) (def_ a✝¹ a✝)
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
case true_ | false_ | not_ | imp_ | and_ | or_ | iff_ => simp only [Formula.IsPrime] at h1
F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (a✝¹.iff_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (a✝¹.iff_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.iff_ a✝) (a✝¹.iff_ a✝)
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
unfold Function.updateITE
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (def_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (def_ a✝¹ a✝) (def_ a✝¹ a✝)
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (fun c => if c = F' then true else V c) (def_ a✝¹ a✝) = if def_ a✝¹ a✝ = F' then def_ a✝¹ a✝ else evalPrimeFfToNot V (def_ a✝¹ a✝)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
simp only [evalPrimeFfToNot]
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (fun c => if c = F' then true else V c) (def_ a✝¹ a✝) = if def_ a✝¹ a✝ = F' then def_ a✝¹ a✝ else evalPrimeFfToNot V (def_ a✝¹ a✝)
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if evalPrime (fun c => if c = F' then true else V c) (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then def_ a✝¹ a✝ else if evalPrime V (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
simp only [Formula.evalPrime]
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if evalPrime (fun c => if c = F' then true else V c) (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then def_ a✝¹ a✝ else if evalPrime V (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if (if def_ a✝¹ a✝ = F' then true else V (def_ a✝¹ a✝)) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then def_ a✝¹ a✝ else if V (def_ a✝¹ a✝) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
split_ifs <;> tauto
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if (if def_ a✝¹ a✝ = F' then true else V (def_ a✝¹ a✝)) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then def_ a✝¹ a✝ else if V (def_ a✝¹ a✝) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_true
[936, 1]
[950, 38]
simp only [Formula.IsPrime] at h1
F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' true) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝ a✝ h1 : (a✝¹.iff_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' true) (a✝¹.iff_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.iff_ a✝) (a✝¹.iff_ a✝)
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
induction F
F F' : Formula V : VarBoolAssignment h1 : F.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) F = Function.updateITE (evalPrimeFfToNot V) F' F.not_ F
case pred_const_ F' : Formula V : VarBoolAssignment a✝¹ : PredName a✝ : List VarName h1 : (pred_const_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (pred_const_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (pred_const_ a✝¹ a✝).not_ (pred_const_ a✝¹ a✝) case pred_var_ F' : Formula V : VarBoolAssignment a✝¹ : PredName a✝ : List VarName h1 : (pred_var_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (pred_var_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (pred_var_ a✝¹ a✝).not_ (pred_var_ a✝¹ a✝) case eq_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : VarName h1 : (eq_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (eq_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (eq_ a✝¹ a✝).not_ (eq_ a✝¹ a✝) case true_ F' : Formula V : VarBoolAssignment h1 : true_.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) true_ = Function.updateITE (evalPrimeFfToNot V) F' true_.not_ true_ case false_ F' : Formula V : VarBoolAssignment h1 : false_.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) false_ = Function.updateITE (evalPrimeFfToNot V) F' false_.not_ false_ case not_ F' : Formula V : VarBoolAssignment a✝ : Formula a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : a✝.not_.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) a✝.not_ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_.not_ a✝.not_ case imp_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹.not_ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (a✝¹.imp_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (a✝¹.imp_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.imp_ a✝).not_ (a✝¹.imp_ a✝) case and_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹.not_ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (a✝¹.and_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (a✝¹.and_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.and_ a✝).not_ (a✝¹.and_ a✝) case or_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹.not_ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (a✝¹.or_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (a✝¹.or_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.or_ a✝).not_ (a✝¹.or_ a✝) case iff_ F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹.not_ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (a✝¹.iff_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (a✝¹.iff_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.iff_ a✝).not_ (a✝¹.iff_ a✝) case forall_ F' : Formula V : VarBoolAssignment a✝¹ : VarName a✝ : Formula a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (forall_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (forall_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (forall_ a✝¹ a✝).not_ (forall_ a✝¹ a✝) case exists_ F' : Formula V : VarBoolAssignment a✝¹ : VarName a✝ : Formula a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (exists_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (exists_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (exists_ a✝¹ a✝).not_ (exists_ a✝¹ a✝) case def_ F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (def_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (def_ a✝¹ a✝).not_ (def_ a✝¹ a✝)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
case pred_const_ | pred_var_ | eq_ | forall_ | exists_ | def_ => unfold Function.updateITE simp only [evalPrimeFfToNot] simp only [Formula.evalPrime] split_ifs <;> tauto
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (def_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (def_ a✝¹ a✝).not_ (def_ a✝¹ a✝)
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
case true_ | false_ | not_ | imp_ | and_ | or_ | iff_ => simp only [Formula.IsPrime] at h1
F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹.not_ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (a✝¹.iff_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (a✝¹.iff_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.iff_ a✝).not_ (a✝¹.iff_ a✝)
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
unfold Function.updateITE
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (def_ a✝¹ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (def_ a✝¹ a✝).not_ (def_ a✝¹ a✝)
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (fun c => if c = F' then false else V c) (def_ a✝¹ a✝) = if def_ a✝¹ a✝ = F' then (def_ a✝¹ a✝).not_ else evalPrimeFfToNot V (def_ a✝¹ a✝)
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
simp only [evalPrimeFfToNot]
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ evalPrimeFfToNot (fun c => if c = F' then false else V c) (def_ a✝¹ a✝) = if def_ a✝¹ a✝ = F' then (def_ a✝¹ a✝).not_ else evalPrimeFfToNot V (def_ a✝¹ a✝)
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if evalPrime (fun c => if c = F' then false else V c) (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then (def_ a✝¹ a✝).not_ else if evalPrime V (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
simp only [Formula.evalPrime]
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if evalPrime (fun c => if c = F' then false else V c) (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then (def_ a✝¹ a✝).not_ else if evalPrime V (def_ a✝¹ a✝) then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if (if def_ a✝¹ a✝ = F' then false else V (def_ a✝¹ a✝)) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then (def_ a✝¹ a✝).not_ else if V (def_ a✝¹ a✝) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
split_ifs <;> tauto
F' : Formula V : VarBoolAssignment a✝¹ : DefName a✝ : List VarName h1 : (def_ a✝¹ a✝).IsPrime ⊒ (if (if def_ a✝¹ a✝ = F' then false else V (def_ a✝¹ a✝)) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_) = if def_ a✝¹ a✝ = F' then (def_ a✝¹ a✝).not_ else if V (def_ a✝¹ a✝) = true then def_ a✝¹ a✝ else (def_ a✝¹ a✝).not_
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.evalPrimeFfToNot_of_function_updateIte_false
[953, 1]
[967, 38]
simp only [Formula.IsPrime] at h1
F' : Formula V : VarBoolAssignment a✝¹ a✝ : Formula a_ih✝¹ : a✝¹.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝¹ = Function.updateITE (evalPrimeFfToNot V) F' a✝¹.not_ a✝¹ a_ih✝ : a✝.IsPrime β†’ evalPrimeFfToNot (Function.updateITE V F' false) a✝ = Function.updateITE (evalPrimeFfToNot V) F' a✝.not_ a✝ h1 : (a✝¹.iff_ a✝).IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V F' false) (a✝¹.iff_ a✝) = Function.updateITE (evalPrimeFfToNot V) F' (a✝¹.iff_ a✝).not_ (a✝¹.iff_ a✝)
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
apply Set.image_congr
U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” ⊒ evalPrimeFfToNot (Function.updateITE V U b) '' Ξ” = evalPrimeFfToNot V '' Ξ”
case h U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” ⊒ βˆ€ a ∈ Ξ”, evalPrimeFfToNot (Function.updateITE V U b) a = evalPrimeFfToNot V a
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
intro U' a1
case h U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” ⊒ βˆ€ a ∈ Ξ”, evalPrimeFfToNot (Function.updateITE V U b) a = evalPrimeFfToNot V a
case h U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” ⊒ evalPrimeFfToNot (Function.updateITE V U b) U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
specialize h1_Ξ” U' a1
case h U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” ⊒ evalPrimeFfToNot (Function.updateITE V U b) U' = evalPrimeFfToNot V U'
case h U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V U b) U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
cases b
case h U : Formula Ξ” : Set Formula V : VarBoolAssignment b : Bool h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V U b) U' = evalPrimeFfToNot V U'
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V U false) U' = evalPrimeFfToNot V U' case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V U true) U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
simp only [evalPrimeFfToNot_of_function_updateIte_false U' U V h1_Ξ”]
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V U false) U' = evalPrimeFfToNot V U'
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ Function.updateITE (evalPrimeFfToNot V) U U'.not_ U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
simp only [Function.updateITE]
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ Function.updateITE (evalPrimeFfToNot V) U U'.not_ U' = evalPrimeFfToNot V U'
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ (if U' = U then U'.not_ else evalPrimeFfToNot V U') = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
simp
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ (if U' = U then U'.not_ else evalPrimeFfToNot V U') = evalPrimeFfToNot V U'
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ U' = U β†’ U'.not_ = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
intro a2
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ U' = U β†’ U'.not_ = evalPrimeFfToNot V U'
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime a2 : U' = U ⊒ U'.not_ = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
subst a2
case h.false U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime a2 : U' = U ⊒ U'.not_ = evalPrimeFfToNot V U'
case h.false Ξ” : Set Formula V : VarBoolAssignment U' : Formula a1 : U' ∈ Ξ” h1_Ξ” h1_U : U'.IsPrime h2 : U' βˆ‰ Ξ” ⊒ U'.not_ = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
contradiction
case h.false Ξ” : Set Formula V : VarBoolAssignment U' : Formula a1 : U' ∈ Ξ” h1_Ξ” h1_U : U'.IsPrime h2 : U' βˆ‰ Ξ” ⊒ U'.not_ = evalPrimeFfToNot V U'
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
simp only [evalPrimeFfToNot_of_function_updateIte_true U' U V h1_Ξ”]
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ evalPrimeFfToNot (Function.updateITE V U true) U' = evalPrimeFfToNot V U'
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ Function.updateITE (evalPrimeFfToNot V) U U' U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
simp only [Function.updateITE]
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ Function.updateITE (evalPrimeFfToNot V) U U' U' = evalPrimeFfToNot V U'
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ (if U' = U then U' else evalPrimeFfToNot V U') = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
simp
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ (if U' = U then U' else evalPrimeFfToNot V U') = evalPrimeFfToNot V U'
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ U' = U β†’ U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
intro a2
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime ⊒ U' = U β†’ U' = evalPrimeFfToNot V U'
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime a2 : U' = U ⊒ U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
subst a2
case h.true U : Formula Ξ” : Set Formula V : VarBoolAssignment h1_U : U.IsPrime h2 : U βˆ‰ Ξ” U' : Formula a1 : U' ∈ Ξ” h1_Ξ” : U'.IsPrime a2 : U' = U ⊒ U' = evalPrimeFfToNot V U'
case h.true Ξ” : Set Formula V : VarBoolAssignment U' : Formula a1 : U' ∈ Ξ” h1_Ξ” h1_U : U'.IsPrime h2 : U' βˆ‰ Ξ” ⊒ U' = evalPrimeFfToNot V U'
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.image_of_evalPrimeFfToNot_of_function_updateIte
[970, 1]
[996, 18]
contradiction
case h.true Ξ” : Set Formula V : VarBoolAssignment U' : Formula a1 : U' ∈ Ξ” h1_Ξ” h1_U : U'.IsPrime h2 : U' βˆ‰ Ξ” ⊒ U' = evalPrimeFfToNot V U'
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
intro V
P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ”) P
P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P V : VarBoolAssignment ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
apply T_14_9_Deduct P U (Ξ”.image (evalPrimeFfToNot V))
P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P V : VarBoolAssignment ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ”) P
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P V : VarBoolAssignment ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P V : VarBoolAssignment ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
specialize h3 (Function.updateITE V U true)
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P V : VarBoolAssignment ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot (Function.updateITE V U true) '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U true) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [image_of_evalPrimeFfToNot_of_function_updateIte U Ξ” V true h1_Ξ” h1_U h2] at h3
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot (Function.updateITE V U true) '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U true) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U true) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [evalPrimeFfToNot_of_function_updateIte_true U U V h1_U] at h3
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U true) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {Function.updateITE (evalPrimeFfToNot V) U U U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [Function.updateITE] at h3
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {Function.updateITE (evalPrimeFfToNot V) U U U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {if True then U else evalPrimeFfToNot V U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [eq_self_iff_true, if_true] at h3
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {if True then U else evalPrimeFfToNot V U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
exact h3
case h1 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U}) P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
specialize h3 (Function.updateITE V U Bool.false)
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” h3 : βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot V U}) P V : VarBoolAssignment ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot (Function.updateITE V U false) '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U false) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [image_of_evalPrimeFfToNot_of_function_updateIte U Ξ” V false h1_Ξ” h1_U h2] at h3
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot (Function.updateITE V U false) '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U false) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U false) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [evalPrimeFfToNot_of_function_updateIte_false U U V h1_U] at h3
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {evalPrimeFfToNot (Function.updateITE V U false) U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {Function.updateITE (evalPrimeFfToNot V) U U.not_ U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [Function.updateITE] at h3
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {Function.updateITE (evalPrimeFfToNot V) U U.not_ U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {if True then U.not_ else evalPrimeFfToNot V U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
simp only [eq_self_iff_true, if_true] at h3
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {if True then U.not_ else evalPrimeFfToNot V U}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAuxAux
[999, 1]
[1021, 13]
exact h3
case h2 P U : Formula Ξ” : Set Formula h1_Ξ” : βˆ€ U' ∈ Ξ”, U'.IsPrime h1_U : U.IsPrime h2 : U βˆ‰ Ξ” V : VarBoolAssignment h3 : IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P ⊒ IsDeduct (evalPrimeFfToNot V '' Ξ” βˆͺ {U.not_}) P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
induction Ξ”_U using Finset.induction_on
P : Formula Ξ”_U : Finset Formula h1 : Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P ⊒ IsDeduct βˆ… P
case empty P : Formula h1 : βˆ… βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) βˆ…)) P ⊒ IsDeduct βˆ… P case insert P a✝² : Formula s✝ : Finset Formula a✝¹ : a✝² βˆ‰ s✝ a✝ : s✝ βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) s✝)) P) β†’ IsDeduct βˆ… P h1 : insert a✝² s✝ βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert a✝² s✝))) P ⊒ IsDeduct βˆ… P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
case empty => simp at h2 exact h2
P : Formula h1 : βˆ… βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) βˆ…)) P ⊒ IsDeduct βˆ… P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
simp at h2
P : Formula h1 : βˆ… βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) βˆ…)) P ⊒ IsDeduct βˆ… P
P : Formula h1 : βˆ… βŠ† P.primeSet h2 : IsDeduct βˆ… P ⊒ IsDeduct βˆ… P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
exact h2
P : Formula h1 : βˆ… βŠ† P.primeSet h2 : IsDeduct βˆ… P ⊒ IsDeduct βˆ… P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
apply Ξ”_U_2
P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : insert U Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P ⊒ IsDeduct βˆ… P
case h1 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : insert U Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P ⊒ Ξ”_U βŠ† P.primeSet case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : insert U Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
simp only [Finset.insert_subset_iff] at h1
case h1 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : insert U Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P ⊒ Ξ”_U βŠ† P.primeSet
case h1 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P h1 : U ∈ P.primeSet ∧ Ξ”_U βŠ† P.primeSet ⊒ Ξ”_U βŠ† P.primeSet
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
cases h1
case h1 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P h1 : U ∈ P.primeSet ∧ Ξ”_U βŠ† P.primeSet ⊒ Ξ”_U βŠ† P.primeSet
case h1.intro P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P left✝ : U ∈ P.primeSet right✝ : Ξ”_U βŠ† P.primeSet ⊒ Ξ”_U βŠ† P.primeSet
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
case intro h1_left h1_right => exact h1_right
P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ Ξ”_U βŠ† P.primeSet
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
exact h1_right
P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ Ξ”_U βŠ† P.primeSet
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
simp only [Finset.insert_subset_iff] at h1
case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : insert U Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P h1 : U ∈ P.primeSet ∧ Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
simp at h2
case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) (insert U Ξ”_U))) P h1 : U ∈ P.primeSet ∧ Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : U ∈ P.primeSet ∧ Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
cases h1
case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h1 : U ∈ P.primeSet ∧ Ξ”_U βŠ† P.primeSet h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
case h2.intro P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P left✝ : U ∈ P.primeSet right✝ : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
simp
P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P
P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' ↑Δ_U) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
apply propCompleteAuxAux P U Ξ”_U
P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' ↑Δ_U) P
case h1_Ξ” P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ U' ∈ ↑Δ_U, U'.IsPrime case h1_U P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ U.IsPrime case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ U βˆ‰ ↑Δ_U case h3 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' ↑Δ_U βˆͺ {evalPrimeFfToNot V U}) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
intro U' a1
case h1_Ξ” P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ U' ∈ ↑Δ_U, U'.IsPrime
case h1_Ξ” P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet U' : Formula a1 : U' ∈ ↑Δ_U ⊒ U'.IsPrime
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
apply mem_primeSet_isPrime P U'
case h1_Ξ” P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet U' : Formula a1 : U' ∈ ↑Δ_U ⊒ U'.IsPrime
case h1_Ξ” P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet U' : Formula a1 : U' ∈ ↑Δ_U ⊒ U' ∈ P.primeSet
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
apply h1_right
case h1_Ξ” P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet U' : Formula a1 : U' ∈ ↑Δ_U ⊒ U' ∈ P.primeSet
case h1_Ξ”.a P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet U' : Formula a1 : U' ∈ ↑Δ_U ⊒ U' ∈ Ξ”_U
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
exact a1
case h1_Ξ”.a P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet U' : Formula a1 : U' ∈ ↑Δ_U ⊒ U' ∈ Ξ”_U
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
apply mem_primeSet_isPrime P U
case h1_U P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ U.IsPrime
case h1_U P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ U ∈ P.primeSet
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
exact h1_left
case h1_U P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ U ∈ P.primeSet
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
exact Ξ”_U_1
case h2 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ U βˆ‰ ↑Δ_U
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
simp
case h3 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (evalPrimeFfToNot V '' ↑Δ_U βˆͺ {evalPrimeFfToNot V U}) P
case h3 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.propCompleteAux
[1024, 1]
[1057, 19]
exact h2
case h3 P U : Formula Ξ”_U : Finset Formula Ξ”_U_1 : U βˆ‰ Ξ”_U Ξ”_U_2 : Ξ”_U βŠ† P.primeSet β†’ (βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) Ξ”_U)) P) β†’ IsDeduct βˆ… P h2 : βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P h1_left : U ∈ P.primeSet h1_right : Ξ”_U βŠ† P.primeSet ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (insert (evalPrimeFfToNot V U) (evalPrimeFfToNot V '' ↑Δ_U)) P
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
simp only [IsProof]
P : Formula h1 : P.IsTautoPrime ⊒ IsProof P
P : Formula h1 : P.IsTautoPrime ⊒ IsDeduct βˆ… P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
apply propCompleteAux P P.primeSet
P : Formula h1 : P.IsTautoPrime ⊒ IsDeduct βˆ… P
case h1 P : Formula h1 : P.IsTautoPrime ⊒ P.primeSet βŠ† P.primeSet case h2 P : Formula h1 : P.IsTautoPrime ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) P.primeSet)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
rfl
case h1 P : Formula h1 : P.IsTautoPrime ⊒ P.primeSet βŠ† P.primeSet
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
intro V
case h2 P : Formula h1 : P.IsTautoPrime ⊒ βˆ€ (V : VarBoolAssignment), IsDeduct (↑(Finset.image (evalPrimeFfToNot V) P.primeSet)) P
case h2 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ IsDeduct (↑(Finset.image (evalPrimeFfToNot V) P.primeSet)) P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
apply L_15_7 P P P.primeSet V (P.primeSet.image (evalPrimeFfToNot V))
case h2 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ IsDeduct (↑(Finset.image (evalPrimeFfToNot V) P.primeSet)) P
case h2.h1 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ ↑P.primeSet βŠ† ↑P.primeSet case h2.h2 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ ↑(Finset.image (evalPrimeFfToNot V) P.primeSet) = evalPrimeFfToNot V '' ↑P.primeSet case h2.h3 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ P = evalPrimeFfToNot V P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
rfl
case h2.h1 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ ↑P.primeSet βŠ† ↑P.primeSet
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
simp only [Finset.coe_image]
case h2.h2 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ ↑(Finset.image (evalPrimeFfToNot V) P.primeSet) = evalPrimeFfToNot V '' ↑P.primeSet
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
simp only [Formula.IsTautoPrime] at h1
case h2.h3 P : Formula h1 : P.IsTautoPrime V : VarBoolAssignment ⊒ P = evalPrimeFfToNot V P
case h2.h3 P : Formula h1 : βˆ€ (V : VarBoolAssignment), evalPrime V P V : VarBoolAssignment ⊒ P = evalPrimeFfToNot V P
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
simp only [evalPrimeFfToNot]
case h2.h3 P : Formula h1 : βˆ€ (V : VarBoolAssignment), evalPrime V P V : VarBoolAssignment ⊒ P = evalPrimeFfToNot V P
case h2.h3 P : Formula h1 : βˆ€ (V : VarBoolAssignment), evalPrime V P V : VarBoolAssignment ⊒ P = if evalPrime V P then P else P.not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
specialize h1 V
case h2.h3 P : Formula h1 : βˆ€ (V : VarBoolAssignment), evalPrime V P V : VarBoolAssignment ⊒ P = if evalPrime V P then P else P.not_
case h2.h3 P : Formula V : VarBoolAssignment h1 : evalPrime V P ⊒ P = if evalPrime V P then P else P.not_
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Margaris/Prop.lean
FOL.NV.prop_complete
[1063, 1]
[1078, 28]
simp only [if_pos h1]
case h2.h3 P : Formula V : VarBoolAssignment h1 : evalPrime V P ⊒ P = if evalPrime V P then P else P.not_
no goals
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/Finset.lean
Finset.union_subset_left_right
[8, 1]
[23, 44]
apply Finset.union_subset_iff.mpr
Ξ± : Type inst✝ : DecidableEq Ξ± A B C D : Finset Ξ± h1 : A βŠ† C h2 : B βŠ† D ⊒ A βˆͺ B βŠ† C βˆͺ D
Ξ± : Type inst✝ : DecidableEq Ξ± A B C D : Finset Ξ± h1 : A βŠ† C h2 : B βŠ† D ⊒ A βŠ† C βˆͺ D ∧ B βŠ† C βˆͺ D
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/Finset.lean
Finset.union_subset_left_right
[8, 1]
[23, 44]
constructor
Ξ± : Type inst✝ : DecidableEq Ξ± A B C D : Finset Ξ± h1 : A βŠ† C h2 : B βŠ† D ⊒ A βŠ† C βˆͺ D ∧ B βŠ† C βˆͺ D
case left Ξ± : Type inst✝ : DecidableEq Ξ± A B C D : Finset Ξ± h1 : A βŠ† C h2 : B βŠ† D ⊒ A βŠ† C βˆͺ D case right Ξ± : Type inst✝ : DecidableEq Ξ± A B C D : Finset Ξ± h1 : A βŠ† C h2 : B βŠ† D ⊒ B βŠ† C βˆͺ D