Theorem ralrexbidOLD 3251

Description: Obsolete version of ralrexbid 3250 as of 4-Nov-2024. (Contributed by AV, 21-Oct-2023.) Reduce axiom usage. (Revised by SN, 13-Nov-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
ralrexbid.1	⊢ (𝜑 → (𝜓 ↔ 𝜃))

Assertion

Ref	Expression
ralrexbidOLD	⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐴 𝜃))

Proof of Theorem ralrexbidOLD

Step	Hyp	Ref	Expression
1		df-ral 3068	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
2		ralrexbid.1	. . . . . 6 ⊢ (𝜑 → (𝜓 ↔ 𝜃))
3	2	imim2i 16	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 → 𝜑) → (𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜃)))
4	3	pm5.32d 576	. . . 4 ⊢ ((𝑥 ∈ 𝐴 → 𝜑) → ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜃)))
5	4	alexbii 1836	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜃)))
6	1, 5	sylbi 216	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜃)))
7		df-rex 3069	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))
8		df-rex 3069	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜃 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜃))
9	6, 7, 8	3bitr4g 313	1 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐴 𝜃))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1537  ∃wex 1783   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784  df-ral 3068  df-rex 3069

This theorem is referenced by: (None)