Step
*
1
of Lemma
Russell-theorem-take2
1. Type ∈ Type@i'
⊢ False
BY
{ Assert ⌜∀T:Type ⋂ Base. (¬(T ∈ T) ∈ Type)⌝⋅ }
1
.....assertion.....
1. Type ∈ Type@i'
⊢ ∀T:Type ⋂ Base. (¬(T ∈ T) ∈ Type)
2
1. Type ∈ Type@i'
2. ∀T:Type ⋂ Base. (¬(T ∈ T) ∈ Type)
⊢ False
Latex:
Latex:
1. Type \mmember{} Type@i'
\mvdash{} False
By
Latex:
Assert \mkleeneopen{}\mforall{}T:Type \mcap{} Base. (\mneg{}(T \mmember{} T) \mmember{} Type)\mkleeneclose{}\mcdot{}
Home
Index