Nuprl Lemma : SudokuSolution_wf

[s:Sudoku()]. ∀[P:SudokuPuzzle()].  (SudokuSolution(s;P) ∈ ℙ)


Proof




Definitions occuring in Statement :  SudokuSolution: SudokuSolution(s;P) SudokuPuzzle: SudokuPuzzle() Sudoku: Sudoku() uall: [x:A]. B[x] prop: member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T SudokuSolution: SudokuSolution(s;P) so_lambda: λ2x.t[x] Sudoku: Sudoku() so_apply: x[s]
Lemmas referenced :  all_wf int_seg_wf l_member_wf sudoku-cell_wf sudoku-allowed_wf SudokuPuzzle_wf Sudoku_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule lemma_by_obid sqequalHypSubstitution isectElimination thin natural_numberEquality hypothesis lambdaEquality setElimination rename hypothesisEquality axiomEquality equalityTransitivity equalitySymmetry isect_memberEquality because_Cache

Latex:
\mforall{}[s:Sudoku()].  \mforall{}[P:SudokuPuzzle()].    (SudokuSolution(s;P)  \mmember{}  \mBbbP{})



Date html generated: 2016_05_15-PM-03_14_17
Last ObjectModification: 2015_12_27-PM-01_02_09

Theory : general


Home Index