Theorem: addRows_spec2 (Table/Proofs.lean)

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
⊢ ∀ (t : Table sch) (rs : List (Row sch)), nrows (addRows t rs) = nrows t + List.length rs
Tactic:
intro t rs
State after:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t : Table sch
rs : List (Row sch)
⊢ nrows (addRows t rs) = nrows t + List.length rs

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t : Table sch
rs : List (Row sch)
⊢ nrows (addRows t rs) = nrows t + List.length rs
Tactic:
simp only [nrows, Schema.length_eq_List_length]
State after:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t : Table sch
rs : List (Row sch)
⊢ List.length (addRows t rs).rows = List.length t.rows + List.length rs

State before:
η : Type u_η
dec_η : DecidableEq η
sch : Schema
t : Table sch
rs : List (Row sch)
⊢ List.length (addRows t rs).rows = List.length t.rows + List.length rs
Tactic:
exact List.length_append t.rows rs
State after:
no goals