Theorem rexabsod 45939

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

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  ∃wrex 3087  Tr wtr 5212

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-v 3453  df-ss 3916  df-uni 4868  df-tr 5213

This theorem is used by:  rexabsobidv  45941