ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  reusv3i GIF version

Theorem reusv3i 4605
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 2250 . . . . . 6 (𝑦 = 𝑧 → (𝑥 = 𝐶 ↔ 𝑥 = 𝐷))
41, 3imbi12d 234 . . . . 5 (𝑦 = 𝑧 → ((𝜑 → 𝑥 = 𝐶) ↔ (𝜓 → 𝑥 = 𝐷)))
54cbvralv 2786 . . . 4 (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ↔ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷))
65biimpi 120 . . 3 (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷))
7 raaanv 3634 . . . 4 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) ↔ (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ∧ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)))
8 anim12 344 . . . . . . 7 (((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ((𝜑 ∧ 𝜓) → (𝑥 = 𝐶 ∧ 𝑥 = 𝐷)))
9 eqtr2 2257 . . . . . . 7 ((𝑥 = 𝐶 ∧ 𝑥 = 𝐷) → 𝐶 = 𝐷)
108, 9syl6 33 . . . . . 6 (((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
1110ralimi 2613 . . . . 5 (∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
1211ralimi 2613 . . . 4 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
137, 12sylbir 135 . . 3 ((∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ∧ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
146, 13mpdan 425 . 2 (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
1514rexlimivw 2664 1 (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∀wral 2528  ∃wrex 2529
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534
This theorem is used by:  reusv3  4606
  Copyright terms: Public domain W3C validator