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

Theorem eqvincg 2732
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 2627 . . . 4 (𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
2 ax-1 5 . . . . . 6 (𝑥 = 𝐴 → (𝐴 = 𝐵𝑥 = 𝐴))
3 eqtr 2102 . . . . . . 7 ((𝑥 = 𝐴𝐴 = 𝐵) → 𝑥 = 𝐵)
43ex 113 . . . . . 6 (𝑥 = 𝐴 → (𝐴 = 𝐵𝑥 = 𝐵))
52, 4jca 300 . . . . 5 (𝑥 = 𝐴 → ((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)))
65eximi 1534 . . . 4 (∃𝑥 𝑥 = 𝐴 → ∃𝑥((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)))
7 pm3.43 567 . . . . 5 (((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)) → (𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)))
87eximi 1534 . . . 4 (∃𝑥((𝐴 = 𝐵𝑥 = 𝐴) ∧ (𝐴 = 𝐵𝑥 = 𝐵)) → ∃𝑥(𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)))
91, 6, 83syl 17 . . 3 (𝐴𝑉 → ∃𝑥(𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)))
10 nfv 1464 . . . 4 𝑥 𝐴 = 𝐵
111019.37-1 1607 . . 3 (∃𝑥(𝐴 = 𝐵 → (𝑥 = 𝐴𝑥 = 𝐵)) → (𝐴 = 𝐵 → ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
129, 11syl 14 . 2 (𝐴𝑉 → (𝐴 = 𝐵 → ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
13 eqtr2 2103 . . 3 ((𝑥 = 𝐴𝑥 = 𝐵) → 𝐴 = 𝐵)
1413exlimiv 1532 . 2 (∃𝑥(𝑥 = 𝐴𝑥 = 𝐵) → 𝐴 = 𝐵)
1512, 14impbid1 140 1 (𝐴𝑉 → (𝐴 = 𝐵 ↔ ∃𝑥(𝑥 = 𝐴𝑥 = 𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1287  wex 1424  wcel 1436
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1379  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-ext 2067
This theorem depends on definitions:  df-bi 115  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-v 2617
This theorem is referenced by:  dff13  5502  f1eqcocnv  5525
  Copyright terms: Public domain W3C validator