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

Theorem reusv3i 5366
Description: Two ways of expressing existential uniqueness via an indirect equality. (Contributed by NM, 23-Dec-2012.)
Hypotheses
Ref Expression
reusv3.1 (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
reusv3.2 (𝑦 = 𝑧 → 𝐶 = 𝐷)
Assertion
Ref Expression
reusv3i (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐶,𝑧   𝑥,𝐷,𝑦   𝜑,𝑥,𝑧   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑧)   𝐴(𝑥, 𝑦, 𝑧)   𝐶(𝑦)   𝐷(𝑧)

Proof of Theorem reusv3i
StepHypRef Expression
1 reusv3.1 . . . . . 6 (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
2 reusv3.2 . . . . . . 7 (𝑦 = 𝑧 → 𝐶 = 𝐷)
32eqeq2d 2772 . . . . . 6 (𝑦 = 𝑧 → (𝑥 = 𝐶 ↔ 𝑥 = 𝐷))
41, 3imbi12d 347 . . . . 5 (𝑦 = 𝑧 → ((𝜑 → 𝑥 = 𝐶) ↔ (𝜓 → 𝑥 = 𝐷)))
54cbvralvw 3241 . . . 4 (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ↔ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷))
65biimpi 219 . . 3 (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷))
7 raaanv 4475 . . . 4 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) ↔ (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ∧ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)))
8 anim12 821 . . . . . 6 (((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ((𝜑 ∧ 𝜓) → (𝑥 = 𝐶 ∧ 𝑥 = 𝐷)))
9 eqtr2 2782 . . . . . 6 ((𝑥 = 𝐶 ∧ 𝑥 = 𝐷) → 𝐶 = 𝐷)
108, 9syl6 36 . . . . 5 (((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
11102ralimi 3133 . . . 4 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
127, 11sylbir 238 . . 3 ((∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ∧ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
136, 12mpdan 700 . 2 (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
1413rexlimivw 3160 1 (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∀wral 3077  ∃wrex 3087
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-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-dif 3902  df-nul 4280
This theorem is used by:  reusv3  5367
  Copyright terms: Public domain W3C validator