Theorem rmoimi2 3701

Description: Restricted "at most one" is preserved through implication (note wff reversal). (Contributed by Alexander van der Vekens, 17-Jun-2017.)

Hypothesis

Ref	Expression
rmoimi2.1	⊢ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓))

Assertion

Ref	Expression
rmoimi2	⊢ (∃*𝑥 ∈ 𝐵 𝜓 → ∃*𝑥 ∈ 𝐴 𝜑)

Proof of Theorem rmoimi2

Step	Hyp	Ref	Expression
1		rmoimi2.1	. . 3 ⊢ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓))
2		moim 2570	. . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓)) → (∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜓) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
3	1, 2	ax-mp 5	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜓) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
4		df-rmo 3366	. 2 ⊢ (∃*𝑥 ∈ 𝐵 𝜓 ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜓))
5		df-rmo 3366	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
6	3, 4, 5	3imtr4i 295	1 ⊢ (∃*𝑥 ∈ 𝐵 𝜓 → ∃*𝑥 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   ∈ wcel 2145  ∃*wmo 2563  ∃*wrmo 3365

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

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2565  df-rmo 3366

This theorem is used by: (None)