Theorem imaeqsexvOLD 7349

Description: Obsolete version of rexima 7224 as of 14-Aug-2025. Duplicate version of rexima 7224. (Contributed by Scott Fenton, 27-Sep-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
imaeqsexvOLD.1	⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
imaeqsexvOLD	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝜑,𝑦   𝜓,𝑥

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

Proof of Theorem imaeqsexvOLD

Step	Hyp	Ref	Expression
1		df-rex 3089	. . 3 ⊢ (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑥(𝑥 ∈ (𝐹 “ 𝐵) ∧ 𝜑))
2		fvelimab 6941	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥))
3	2	anbi1d 640	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → ((𝑥 ∈ (𝐹 “ 𝐵) ∧ 𝜑) ↔ (∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑)))
4	3	exbidv 1943	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥(𝑥 ∈ (𝐹 “ 𝐵) ∧ 𝜑) ↔ ∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑)))
5	1, 4	bitrid 285	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑)))
6		rexcom4 3291	. . 3 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑥∃𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 𝑥 ∧ 𝜑))
7		eqcom 2771	. . . . . . 7 ⊢ ((𝐹‘𝑦) = 𝑥 ↔ 𝑥 = (𝐹‘𝑦))
8	7	anbi1i 633	. . . . . 6 ⊢ (((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ (𝑥 = (𝐹‘𝑦) ∧ 𝜑))
9	8	exbii 1870	. . . . 5 ⊢ (∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑥(𝑥 = (𝐹‘𝑦) ∧ 𝜑))
10		fvex 6882	. . . . . 6 ⊢ (𝐹‘𝑦) ∈ V
11		imaeqsexvOLD.1	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓))
12	10, 11	ceqsexv 3504	. . . . 5 ⊢ (∃𝑥(𝑥 = (𝐹‘𝑦) ∧ 𝜑) ↔ 𝜓)
13	9, 12	bitri 277	. . . 4 ⊢ (∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ 𝜓)
14	13	rexbii 3111	. . 3 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓)
15		r19.41v 3194	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ (∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑))
16	15	exbii 1870	. . 3 ⊢ (∃𝑥∃𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑))
17	6, 14, 16	3bitr3ri 304	. 2 ⊢ (∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓)
18	5, 17	bitrdi 289	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1562  ∃wex 1801   ∈ wcel 2144  ∃wrex 3088   ⊆ wss 3906   “ cima 5652   Fn wfn 6518  ‘cfv 6523

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-fv 6531

This theorem is referenced by:  imaeqsalvOLD  7350