Theorem repizf2lem 4190

Description: Lemma for repizf2 4191. If we have a function-like proposition which provides at most one value of 𝑦 for each 𝑥 in a set 𝑤, we can change "at most one" to "exactly one" by restricting the values of 𝑥 to those values for which the proposition provides a value of 𝑦. (Contributed by Jim Kingdon, 7-Sep-2018.)

Assertion

Ref	Expression
repizf2lem	⊢ (∀𝑥 ∈ 𝑤 ∃*𝑦𝜑 ↔ ∀𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑}∃!𝑦𝜑)

Proof of Theorem repizf2lem

Step	Hyp	Ref	Expression
1		df-mo 2046	. . . 4 ⊢ (∃*𝑦𝜑 ↔ (∃𝑦𝜑 → ∃!𝑦𝜑))
2	1	imbi2i 226	. . 3 ⊢ ((𝑥 ∈ 𝑤 → ∃*𝑦𝜑) ↔ (𝑥 ∈ 𝑤 → (∃𝑦𝜑 → ∃!𝑦𝜑)))
3	2	albii 1481	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝑤 → ∃*𝑦𝜑) ↔ ∀𝑥(𝑥 ∈ 𝑤 → (∃𝑦𝜑 → ∃!𝑦𝜑)))
4		df-ral 2477	. 2 ⊢ (∀𝑥 ∈ 𝑤 ∃*𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝑤 → ∃*𝑦𝜑))
5		df-ral 2477	. . 3 ⊢ (∀𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑}∃!𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑} → ∃!𝑦𝜑))
6		rabid 2670	. . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑} ↔ (𝑥 ∈ 𝑤 ∧ ∃𝑦𝜑))
7	6	imbi1i 238	. . . . 5 ⊢ ((𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑} → ∃!𝑦𝜑) ↔ ((𝑥 ∈ 𝑤 ∧ ∃𝑦𝜑) → ∃!𝑦𝜑))
8		impexp 263	. . . . 5 ⊢ (((𝑥 ∈ 𝑤 ∧ ∃𝑦𝜑) → ∃!𝑦𝜑) ↔ (𝑥 ∈ 𝑤 → (∃𝑦𝜑 → ∃!𝑦𝜑)))
9	7, 8	bitri 184	. . . 4 ⊢ ((𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑} → ∃!𝑦𝜑) ↔ (𝑥 ∈ 𝑤 → (∃𝑦𝜑 → ∃!𝑦𝜑)))
10	9	albii 1481	. . 3 ⊢ (∀𝑥(𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑} → ∃!𝑦𝜑) ↔ ∀𝑥(𝑥 ∈ 𝑤 → (∃𝑦𝜑 → ∃!𝑦𝜑)))
11	5, 10	bitri 184	. 2 ⊢ (∀𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑}∃!𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝑤 → (∃𝑦𝜑 → ∃!𝑦𝜑)))
12	3, 4, 11	3bitr4i 212	1 ⊢ (∀𝑥 ∈ 𝑤 ∃*𝑦𝜑 ↔ ∀𝑥 ∈ {𝑥 ∈ 𝑤 ∣ ∃𝑦𝜑}∃!𝑦𝜑)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1362  ∃wex 1503  ∃!weu 2042  ∃*wmo 2043   ∈ wcel 2164  ∀wral 2472  {crab 2476

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-sb 1774  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-ral 2477  df-rab 2481

This theorem is referenced by:  repizf2  4191