Theorem rexabsod 44961

Description: Deduction form of rexabso 44959. (Contributed by Eric Schmidt, 19-Oct-2025.)

Hypothesis

Ref	Expression
ralabsod.1	⊢ (𝜑 → Tr 𝑀)

Assertion

Ref	Expression
rexabsod	⊢ ((𝜑 ∧ 𝐴 ∈ 𝑀) → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝑀 (𝑥 ∈ 𝐴 ∧ 𝜓)))

Distinct variable groups:   𝑥,𝑀   𝑥,𝐴

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

Proof of Theorem rexabsod

Step	Hyp	Ref	Expression
1		ralabsod.1	. 2 ⊢ (𝜑 → Tr 𝑀)
2		rexabso 44959	. 2 ⊢ ((Tr 𝑀 ∧ 𝐴 ∈ 𝑀) → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝑀 (𝑥 ∈ 𝐴 ∧ 𝜓)))
3	1, 2	sylan 580	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑀) → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝑀 (𝑥 ∈ 𝐴 ∧ 𝜓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2108  ∃wrex 3069  Tr wtr 5257

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-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2728  df-clel 2815  df-ral 3061  df-rex 3070  df-v 3481  df-ss 3967  df-uni 4906  df-tr 5258

This theorem is referenced by:  rexabsobidv  44963