Theorem imaeqsalvOLD 7364

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

Hypothesis

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

Assertion

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

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

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

Proof of Theorem imaeqsalvOLD

Step	Hyp	Ref	Expression
1		imaeqsexvOLD.1	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓))
2	1	notbid 321	. . . 4 ⊢ (𝑥 = (𝐹‘𝑦) → (¬ 𝜑 ↔ ¬ 𝜓))
3	2	imaeqsexvOLD 7363	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵) ¬ 𝜑 ↔ ∃𝑦 ∈ 𝐵 ¬ 𝜓))
4	3	notbid 321	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (¬ ∃𝑥 ∈ (𝐹 “ 𝐵) ¬ 𝜑 ↔ ¬ ∃𝑦 ∈ 𝐵 ¬ 𝜓))
5		dfral2 3115	. 2 ⊢ (∀𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ¬ ∃𝑥 ∈ (𝐹 “ 𝐵) ¬ 𝜑)
6		dfral2 3115	. 2 ⊢ (∀𝑦 ∈ 𝐵 𝜓 ↔ ¬ ∃𝑦 ∈ 𝐵 ¬ 𝜓)
7	4, 5, 6	3bitr4g 317	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∀𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∀𝑦 ∈ 𝐵 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569  ∀wral 3078  ∃wrex 3088   ⊆ wss 3904   “ cima 5663   Fn wfn 6531  ‘cfv 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544

This theorem is used by: (None)