Theorem: renameColumns_spec3 (Table/Proofs.lean)

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
⊢ ∀ (t : Table sch) (ccs : ActionList Schema.renameColumnCN sch), nrows (renameColumns t ccs) = nrows t
Tactic:
intros
State after:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t✝ : Table sch
ccs✝ : ActionList Schema.renameColumnCN sch
⊢ nrows (renameColumns t✝ ccs✝) = nrows t✝

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t✝ : Table sch
ccs✝ : ActionList Schema.renameColumnCN sch
⊢ nrows (renameColumns t✝ ccs✝) = nrows t✝
Tactic:
simp only [nrows, renameColumns, Schema.length_eq_List_length]
State after:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t✝ : Table sch
ccs✝ : ActionList Schema.renameColumnCN sch
⊢ List.length (List.map (Row.renameCells ccs✝) t✝.rows) = List.length t✝.rows

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t✝ : Table sch
ccs✝ : ActionList Schema.renameColumnCN sch
⊢ List.length (List.map (Row.renameCells ccs✝) t✝.rows) = List.length t✝.rows
Tactic:
apply List.length_map
State after:
no goals