Theorem iota5f 36253

Description: A method for computing iota. (Contributed by Scott Fenton, 13-Dec-2017.)

Hypotheses

Ref	Expression
iota5f.1	⊢ Ⅎ𝑥𝜑
iota5f.2	⊢ Ⅎ𝑥𝐴
iota5f.3	⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (𝜓 ↔ 𝑥 = 𝐴))

Assertion

Ref	Expression
iota5f	⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (℩𝑥𝜓) = 𝐴)

Distinct variable group:   𝑥,𝑉

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)   𝐴(𝑥)

Proof of Theorem iota5f

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iota5f.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2		iota5f.2	. . . . 5 ⊢ Ⅎ𝑥𝐴
3	2	nfel1 2943	. . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ 𝑉
4	1, 3	nfan 1932	. . 3 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐴 ∈ 𝑉)
5		iota5f.3	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (𝜓 ↔ 𝑥 = 𝐴))
6	4, 5	alrimi 2252	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → ∀𝑥(𝜓 ↔ 𝑥 = 𝐴))
7	2	nfeq2 2944	. . . . . 6 ⊢ Ⅎ𝑥 𝑦 = 𝐴
8		eqeq2 2777	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
9	8	bibi2d 345	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜓 ↔ 𝑥 = 𝑦) ↔ (𝜓 ↔ 𝑥 = 𝐴)))
10	7, 9	albid 2261	. . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜓 ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝜓 ↔ 𝑥 = 𝐴)))
11		eqeq2 2777	. . . . 5 ⊢ (𝑦 = 𝐴 → ((℩𝑥𝜓) = 𝑦 ↔ (℩𝑥𝜓) = 𝐴))
12	10, 11	imbi12d 347	. . . 4 ⊢ (𝑦 = 𝐴 → ((∀𝑥(𝜓 ↔ 𝑥 = 𝑦) → (℩𝑥𝜓) = 𝑦) ↔ (∀𝑥(𝜓 ↔ 𝑥 = 𝐴) → (℩𝑥𝜓) = 𝐴)))
13		iotaval 6514	. . . 4 ⊢ (∀𝑥(𝜓 ↔ 𝑥 = 𝑦) → (℩𝑥𝜓) = 𝑦)
14	12, 13	vtoclg 3524	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝜓 ↔ 𝑥 = 𝐴) → (℩𝑥𝜓) = 𝐴))
15	14	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (∀𝑥(𝜓 ↔ 𝑥 = 𝐴) → (℩𝑥𝜓) = 𝐴))
16	6, 15	mpd 16	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (℩𝑥𝜓) = 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2146  Ⅎwnfc 2912  ℩cio 6494

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-v 3459  df-un 3911  df-ss 3923  df-sn 4592  df-pr 4594  df-uni 4875  df-iota 6496

This theorem is used by: (None)