(2steps total) PrintForm Definitions graph 1 1 Sections Graphs Doc

At: union cardinality1

k1,k2:. f:((k1+k2)(k1+k2)). Inj(k1+k2; (k1+k2); f)

By:
Auto
THEN
InstConcl [x.InjCase(x; i. i, k1+i)]
THEN
Unfold `inject` 0
THEN
Reduce 0


Generated subgoal:

11. k1:
2. k2:
3. a1: k1+k2
4. a2: k1+k2
5. InjCase(a1; i. i, k1+i) = InjCase(a2; i. i, k1+i) (k1+k2)
a1 = a2
1 step

About:
natural_numberadduniondecide
lambdafunctionequalallexists

(2steps total) PrintForm Definitions graph 1 1 Sections Graphs Doc