Theorem rexabsod 46069

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

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  ∃wrex 3086  Tr wtr 5211

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-v 3452  df-ss 3897  df-uni 4867  df-tr 5212

This theorem is used by:  rexabsobidv  46071