Theorem reximaOLD 7259

Description: Obsolete version of rexima 7258 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 6921	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) ∈ V)
2		fvelimab 6981	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥))
3		eqcom 2744	. . . 4 ⊢ ((𝐹‘𝑦) = 𝑥 ↔ 𝑥 = (𝐹‘𝑦))
4	3	rexbii 3094	. . 3 ⊢ (∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ↔ ∃𝑦 ∈ 𝐵 𝑥 = (𝐹‘𝑦))
5	2, 4	bitrdi 287	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 = (𝐹‘𝑦)))
6		reximaOLD.x	. . 3 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓))
7	6	adantl 481	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 = (𝐹‘𝑦)) → (𝜑 ↔ 𝜓))
8	1, 5, 7	rexxfr2d 5411	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∃wrex 3070  Vcvv 3480   ⊆ wss 3951   “ cima 5688   Fn wfn 6556  ‘cfv 6561

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-fv 6569

This theorem is referenced by: (None)