Theorem reuss 4273

Description: Transfer uniqueness to a smaller subclass. (Contributed by NM, 21-Aug-1999.)

Assertion

Ref	Expression
reuss	⊢ ((𝐴 ⊆ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜑) → ∃!𝑥 ∈ 𝐴 𝜑)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reuss

Step	Hyp	Ref	Expression
1		id 23	. . . 4 ⊢ (𝜑 → 𝜑)
2	1	rgenw 3080	. . 3 ⊢ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜑)
3		reuss2 4272	. . 3 ⊢ (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜑)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜑)) → ∃!𝑥 ∈ 𝐴 𝜑)
4	2, 3	mpanl2 714	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜑)) → ∃!𝑥 ∈ 𝐴 𝜑)
5	4	3impb 1132	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜑) → ∃!𝑥 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wral 3076  ∃wrex 3086  ∃!wreu 3363   ⊆ wss 3899

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

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ex 1813  df-mo 2564  df-eu 2594  df-clel 2835  df-ral 3077  df-rex 3087  df-reu 3366  df-ss 3916

This theorem is used by:  euelss  4278  riotass  7401  adjbdln  32564  tfsconcatlem  44177  tfsconcatfv  44182