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

Theorem eqvincg 2848
Description: A variable introduction law for class equality, deduction version. (Contributed by Thierry Arnoux, 2-Mar-2017.)
Assertion
Ref Expression
eqvincg (𝐴𝑉 → (𝐴 = 𝐵 ↔ ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem eqvincg
StepHypRef Expression
1 elisset 2738 . . . 4 (𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
2 ax-1 6 . . . . . 6 (𝑥 = 𝐴 → (𝐴 = 𝐵𝑥 = 𝐴))
3 eqtr 2182 . . . . . . 7 ((𝑥 = 𝐴𝐴 = 𝐵) → 𝑥 = 𝐵)
43ex 114 . . . . . 6 (𝑥 = 𝐴 → (𝐴 = 𝐵𝑥 = 𝐵))
52, 4jca 304 . . . . 5 (𝑥 = 𝐴 → ((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)))
65eximi 1587 . . . 4 (∃𝑥 𝑥 = 𝐴 → ∃𝑥((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)))
7 pm3.43 592 . . . . 5 (((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)) → (𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)))
87eximi 1587 . . . 4 (∃𝑥((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)) → ∃𝑥(𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)))
91, 6, 83syl 17 . . 3 (𝐴𝑉 → ∃𝑥(𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)))
10 nfv 1515 . . . 4 𝑥 𝐴 = 𝐵
111019.37-1 1661 . . 3 (∃𝑥(𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)) → (𝐴 = 𝐵 → ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
129, 11syl 14 . 2 (𝐴𝑉 → (𝐴 = 𝐵 → ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
13 eqtr2 2183 . . 3 ((𝑥 = 𝐴𝑥 = 𝐵) → 𝐴 = 𝐵)
1413exlimiv 1585 . 2 (∃𝑥(𝑥 = 𝐴𝑥 = 𝐵) → 𝐴 = 𝐵)
1512, 14impbid1 141 1 (𝐴𝑉 → (𝐴 = 𝐵 ↔ ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1342  wex 1479  wcel 2135
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1434  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-ext 2146
This theorem depends on definitions:  df-bi 116  df-nf 1448  df-sb 1750  df-clab 2151  df-cleq 2157  df-clel 2160  df-v 2726
This theorem is referenced by:  dff13  5733  f1eqcocnv  5756
  Copyright terms: Public domain W3C validator