Theorem iota5f 32955

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 2994	. . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ 𝑉
4	1, 3	nfan 1896	. . 3 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐴 ∈ 𝑉)
5		iota5f.3	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (𝜓 ↔ 𝑥 = 𝐴))
6	4, 5	alrimi 2209	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → ∀𝑥(𝜓 ↔ 𝑥 = 𝐴))
7	2	nfeq2 2995	. . . . . 6 ⊢ Ⅎ𝑥 𝑦 = 𝐴
8		eqeq2 2833	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
9	8	bibi2d 345	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝜓 ↔ 𝑥 = 𝑦) ↔ (𝜓 ↔ 𝑥 = 𝐴)))
10	7, 9	albid 2220	. . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜓 ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝜓 ↔ 𝑥 = 𝐴)))
11		eqeq2 2833	. . . . 5 ⊢ (𝑦 = 𝐴 → ((℩𝑥𝜓) = 𝑦 ↔ (℩𝑥𝜓) = 𝐴))
12	10, 11	imbi12d 347	. . . 4 ⊢ (𝑦 = 𝐴 → ((∀𝑥(𝜓 ↔ 𝑥 = 𝑦) → (℩𝑥𝜓) = 𝑦) ↔ (∀𝑥(𝜓 ↔ 𝑥 = 𝐴) → (℩𝑥𝜓) = 𝐴)))
13		iotaval 6328	. . . 4 ⊢ (∀𝑥(𝜓 ↔ 𝑥 = 𝑦) → (℩𝑥𝜓) = 𝑦)
14	12, 13	vtoclg 3567	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝜓 ↔ 𝑥 = 𝐴) → (℩𝑥𝜓) = 𝐴))
15	14	adantl 484	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (∀𝑥(𝜓 ↔ 𝑥 = 𝐴) → (℩𝑥𝜓) = 𝐴))
16	6, 15	mpd 15	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → (℩𝑥𝜓) = 𝐴)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1531   = wceq 1533  Ⅎwnf 1780   ∈ wcel 2110  Ⅎwnfc 2961  ℩cio 6311

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3496  df-sbc 3772  df-un 3940  df-in 3942  df-ss 3951  df-sn 4567  df-pr 4569  df-uni 4838  df-iota 6313

This theorem is referenced by: (None)