Theorem iota5 4359

Description: A method for computing iota. (Contributed by NM, 17-Sep-2013.)

Hypothesis

Ref	Expression
iota5.1	|- ((ph /\ A e. V) -> (ps <-> x = A))

Assertion

Ref	Expression
iota5	|- ((ph /\ A e. V) -> (iotaxps) = A)

Distinct variable groups:   x,A   x,V   ph,x

Allowed substitution hint:   ps(x)

Proof of Theorem iota5

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iota5.1	. . 3 |- ((ph /\ A e. V) -> (ps <-> x = A))
2	1	alrimiv 1631	. 2 |- ((ph /\ A e. V) -> A.x(ps <-> x = A))
3		eqeq2 2362	. . . . . . 7 |- (y = A -> (x = y <-> x = A))
4	3	bibi2d 309	. . . . . 6 |- (y = A -> ((ps <-> x = y) <-> (ps <-> x = A)))
5	4	albidv 1625	. . . . 5 |- (y = A -> (A.x(ps <-> x = y) <-> A.x(ps <-> x = A)))
6		eqeq2 2362	. . . . 5 |- (y = A -> ((iotaxps) = y <-> (iotaxps) = A))
7	5, 6	imbi12d 311	. . . 4 |- (y = A -> ((A.x(ps <-> x = y) -> (iotaxps) = y) <-> (A.x(ps <-> x = A) -> (iotaxps) = A)))
8		iotaval 4350	. . . 4 |- (A.x(ps <-> x = y) -> (iotaxps) = y)
9	7, 8	vtoclg 2914	. . 3 |- (A e. V -> (A.x(ps <-> x = A) -> (iotaxps) = A))
10	9	adantl 452	. 2 |- ((ph /\ A e. V) -> (A.x(ps <-> x = A) -> (iotaxps) = A))
11	2, 10	mpd 14	1 |- ((ph /\ A e. V) -> (iotaxps) = A)

Syntax hints:   -> wi 4   <-> wb 176   /\ wa 358  A.wal 1540   = wceq 1642   e. wcel 1710  iotacio 4337

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-rex 2620  df-v 2861  df-sbc 3047  df-nin 3211  df-compl 3212  df-un 3214  df-sn 3741  df-pr 3742  df-uni 3892  df-iota 4339

This theorem is referenced by: (None)