Theorem euval 134

Description: Value of the 'exists unique' predicate.

Hypothesis

Ref	Expression
alval.1	|- F:(al -> *)

Assertion

Ref	Expression
euval	|- T. |= [(E!F) = (E.\y:al (A.\x:al [(Fx:al) = [x:al = y:al]]))]

Distinct variable groups:   x,y,al   y,F,x

Proof of Theorem euval

Dummy variable p is distinct from all other variables.

Step	Hyp	Ref	Expression
1		weu 131	. . 3 |- E!:((al -> *) -> *)
2		alval.1	. . 3 |- F:(al -> *)
3	1, 2	wc 45	. 2 |- (E!F):*
4		df-eu 123	. . 3 |- T. |= [E! = \p:(al -> *) (E.\y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]))]
5	1, 2, 4	ceq1 79	. 2 |- T. |= [(E!F) = (\p:(al -> *) (E.\y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]))F)]
6		wex 129	. . . 4 |- E.:((al -> *) -> *)
7		wal 124	. . . . . 6 |- A.:((al -> *) -> *)
8		wv 58	. . . . . . . . 9 |- p:(al -> *):(al -> *)
9		wv 58	. . . . . . . . 9 |- x:al:al
10	8, 9	wc 45	. . . . . . . 8 |- (p:(al -> *)x:al):*
11		wv 58	. . . . . . . . 9 |- y:al:al
12	9, 11	weqi 68	. . . . . . . 8 |- [x:al = y:al]:*
13	10, 12	weqi 68	. . . . . . 7 |- [(p:(al -> *)x:al) = [x:al = y:al]]:*
14	13	wl 59	. . . . . 6 |- \x:al [(p:(al -> *)x:al) = [x:al = y:al]]:(al -> *)
15	7, 14	wc 45	. . . . 5 |- (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]):*
16	15	wl 59	. . . 4 |- \y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]):(al -> *)
17	6, 16	wc 45	. . 3 |- (E.\y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]])):*
18		weq 38	. . . . . . . 8 |- = :(* -> (* -> *))
19	8, 2	weqi 68	. . . . . . . . . 10 |- [p:(al -> *) = F]:*
20	19	id 25	. . . . . . . . 9 |- [p:(al -> *) = F] |= [p:(al -> *) = F]
21	8, 9, 20	ceq1 79	. . . . . . . 8 |- [p:(al -> *) = F] |= [(p:(al -> *)x:al) = (Fx:al)]
22	18, 10, 12, 21	oveq1 89	. . . . . . 7 |- [p:(al -> *) = F] |= [[(p:(al -> *)x:al) = [x:al = y:al]] = [(Fx:al) = [x:al = y:al]]]
23	13, 22	leq 81	. . . . . 6 |- [p:(al -> *) = F] |= [\x:al [(p:(al -> *)x:al) = [x:al = y:al]] = \x:al [(Fx:al) = [x:al = y:al]]]
24	7, 14, 23	ceq2 80	. . . . 5 |- [p:(al -> *) = F] |= [(A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]) = (A.\x:al [(Fx:al) = [x:al = y:al]])]
25	15, 24	leq 81	. . . 4 |- [p:(al -> *) = F] |= [\y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]) = \y:al (A.\x:al [(Fx:al) = [x:al = y:al]])]
26	6, 16, 25	ceq2 80	. . 3 |- [p:(al -> *) = F] |= [(E.\y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]])) = (E.\y:al (A.\x:al [(Fx:al) = [x:al = y:al]]))]
27	17, 2, 26	cl 106	. 2 |- T. |= [(\p:(al -> *) (E.\y:al (A.\x:al [(p:(al -> *)x:al) = [x:al = y:al]]))F) = (E.\y:al (A.\x:al [(Fx:al) = [x:al = y:al]]))]
28	3, 5, 27	eqtri 85	1 |- T. |= [(E!F) = (E.\y:al (A.\x:al [(Fx:al) = [x:al = y:al]]))]

Syntax hints:  tv 1   -> ht 2  *hb 3  kc 5  \kl 6   = ke 7  T.kt 8  [kbr 9   |= wffMMJ2 11  wffMMJ2t 12  A.tal 112  E.tex 113  E!teu 115

This theorem was proved from axioms:  ax-syl 15  ax-jca 17  ax-simpl 20  ax-simpr 21  ax-id 24  ax-trud 26  ax-cb1 29  ax-cb2 30  ax-refl 39  ax-eqmp 42  ax-ceq 46  ax-beta 60  ax-distrc 61  ax-leq 62  ax-hbl1 93  ax-17 95  ax-inst 103

This theorem depends on definitions:  df-ov 65  df-al 116  df-an 118  df-im 119  df-ex 121  df-eu 123

This theorem is referenced by: (None)