Theorem reximaOLD 7175

Description: Obsolete version of rexima 7174 as of 14-Aug-2025. (Contributed by Stefan O'Rear, 21-Jan-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
reximaOLD.x	⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓))

Assertion

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

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

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

Proof of Theorem reximaOLD

Step	Hyp	Ref	Expression
1		fvexd 6837	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) ∈ V)
2		fvelimab 6895	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥))
3		eqcom 2736	. . . 4 ⊢ ((𝐹‘𝑦) = 𝑥 ↔ 𝑥 = (𝐹‘𝑦))
4	3	rexbii 3076	. . 3 ⊢ (∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ↔ ∃𝑦 ∈ 𝐵 𝑥 = (𝐹‘𝑦))
5	2, 4	bitrdi 287	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 = (𝐹‘𝑦)))
6		reximaOLD.x	. . 3 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓))
7	6	adantl 481	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 = (𝐹‘𝑦)) → (𝜑 ↔ 𝜓))
8	1, 5, 7	rexxfr2d 5350	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3053  Vcvv 3436   ⊆ wss 3903   “ cima 5622   Fn wfn 6477  ‘cfv 6482

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-br 5093  df-opab 5155  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-fv 6490

This theorem is referenced by: (None)