MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reuss2 Structured version   Visualization version   GIF version

Theorem reuss2 4272
Description: Transfer uniqueness to a smaller subclass. (Contributed by NM, 20-Oct-2005.)
Assertion
Ref Expression
reuss2 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem reuss2
StepHypRef Expression
1 df-rex 3088 . . 3 (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2 df-reu 3367 . . 3 (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓))
31, 2anbi12i 640 . 2 ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓)))
4 df-ral 3078 . . . . . . 7 (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝜓)))
5 ssel 3925 . . . . . . . . . . . 12 (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
6 pm3.2 475 . . . . . . . . . . . . 13 (𝑥 ∈ 𝐵 → (𝜓 → (𝑥 ∈ 𝐵 ∧ 𝜓)))
76imim2d 58 . . . . . . . . . . . 12 (𝑥 ∈ 𝐵 → ((𝜑 → 𝜓) → (𝜑 → (𝑥 ∈ 𝐵 ∧ 𝜓))))
85, 7syl6 36 . . . . . . . . . . 11 (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 → ((𝜑 → 𝜓) → (𝜑 → (𝑥 ∈ 𝐵 ∧ 𝜓)))))
98a2d 30 . . . . . . . . . 10 (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) → (𝑥 ∈ 𝐴 → (𝜑 → (𝑥 ∈ 𝐵 ∧ 𝜓)))))
109imp4a 428 . . . . . . . . 9 (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) → ((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓))))
1110alimdv 1949 . . . . . . . 8 (𝐴 ⊆ 𝐵 → (∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓))))
1211imp 412 . . . . . . 7 ((𝐴 ⊆ 𝐵 ∧ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝜓))) → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓)))
134, 12sylan2b 606 . . . . . 6 ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓)))
14 euimmo 2642 . . . . . 6 (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜓)) → (∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
1513, 14syl 18 . . . . 5 ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) → (∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
16 df-eu 2595 . . . . . 6 (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
1716simplbi2 506 . . . . 5 (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
1815, 17syl9 78 . . . 4 ((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → (∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))))
1918imp32 424 . . 3 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓))) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
20 df-reu 3367 . . 3 (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2119, 20sylibr 237 . 2 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜓))) → ∃!𝑥 ∈ 𝐴 𝜑)
223, 21sylan2b 606 1 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812   ∈ wcel 2145  ∃*wmo 2563  ∃!weu 2594  ∀wral 3077  ∃wrex 3087  ∃!wreu 3364   ⊆ 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-ex 1813  df-mo 2565  df-eu 2595  df-clel 2836  df-ral 3078  df-rex 3088  df-reu 3367  df-ss 3916
This theorem is used by:  reuss  4273  reuun1  4274  riotass2  7407
  Copyright terms: Public domain W3C validator