Theorem rexabsod 44923

Description: Deduction form of rexabso 44921. (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 44921	. 2 ⊢ ((Tr 𝑀 ∧ 𝐴 ∈ 𝑀) → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝑀 (𝑥 ∈ 𝐴 ∧ 𝜓)))
3	1, 2	sylan 580	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑀) → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝑀 (𝑥 ∈ 𝐴 ∧ 𝜓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2107  ∃wrex 3059  Tr wtr 5226

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1542  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-rex 3060  df-v 3459  df-ss 3941  df-uni 4881  df-tr 5227

This theorem is referenced by:  rexabsobidv  44925