Theorem: completeCases_spec (Table/Proofs.lean)

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
τ : Type u
t : Table sch
c : η
hc : Schema.HasCol (c, τ) sch
⊢ List.length (completeCases t c) = nrows t
Tactic:
simp only [nrows, Schema.length_eq_List_length]
State after:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
τ : Type u
t : Table sch
c : η
hc : Schema.HasCol (c, τ) sch
⊢ List.length (completeCases t c) = List.length t.rows

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
τ : Type u
t : Table sch
c : η
hc : Schema.HasCol (c, τ) sch
⊢ List.length (completeCases t c) = List.length t.rows
Tactic:
exact Eq.trans (List.length_map _ _) (List.length_map _ _)
State after:
no goals