Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  e2ebindALT Structured version   Visualization version   GIF version

Theorem e2ebindALT 42549
Description: Absorption of an existential quantifier of a double existential quantifier of non-distinct variables. The proof is derived by completeusersproof.c from User's Proof in VirtualDeductionProofs.txt. The User's Proof in html format is displayed in e2ebindVD 42532. (Contributed by Alan Sare, 11-Sep-2016.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
e2ebindALT (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝑦𝜑 ↔ ∃𝑦𝜑))

Proof of Theorem e2ebindALT
StepHypRef Expression
1 axc11n 2426 . 2 (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥)
2 nfe1 2147 . . . 4 𝑦𝑦𝜑
3219.9 2198 . . 3 (∃𝑦𝑦𝜑 ↔ ∃𝑦𝜑)
4 excom 2162 . . . 4 (∃𝑦𝑥𝜑 ↔ ∃𝑥𝑦𝜑)
5 nfa1 2148 . . . . . 6 𝑦𝑦 𝑦 = 𝑥
6 id 22 . . . . . . 7 (∀𝑦 𝑦 = 𝑥 → ∀𝑦 𝑦 = 𝑥)
7 biid 260 . . . . . . . . 9 (𝜑𝜑)
87a1i 11 . . . . . . . 8 (∀𝑦 𝑦 = 𝑥 → (𝜑𝜑))
98drex1 2441 . . . . . . 7 (∀𝑦 𝑦 = 𝑥 → (∃𝑦𝜑 ↔ ∃𝑥𝜑))
106, 9syl 17 . . . . . 6 (∀𝑦 𝑦 = 𝑥 → (∃𝑦𝜑 ↔ ∃𝑥𝜑))
115, 10alrimi 2206 . . . . 5 (∀𝑦 𝑦 = 𝑥 → ∀𝑦(∃𝑦𝜑 ↔ ∃𝑥𝜑))
12 exbi 1849 . . . . 5 (∀𝑦(∃𝑦𝜑 ↔ ∃𝑥𝜑) → (∃𝑦𝑦𝜑 ↔ ∃𝑦𝑥𝜑))
1311, 12syl 17 . . . 4 (∀𝑦 𝑦 = 𝑥 → (∃𝑦𝑦𝜑 ↔ ∃𝑦𝑥𝜑))
14 bitr 802 . . . . . 6 (((∃𝑦𝑦𝜑 ↔ ∃𝑦𝑥𝜑) ∧ (∃𝑦𝑥𝜑 ↔ ∃𝑥𝑦𝜑)) → (∃𝑦𝑦𝜑 ↔ ∃𝑥𝑦𝜑))
1514ex 413 . . . . 5 ((∃𝑦𝑦𝜑 ↔ ∃𝑦𝑥𝜑) → ((∃𝑦𝑥𝜑 ↔ ∃𝑥𝑦𝜑) → (∃𝑦𝑦𝜑 ↔ ∃𝑥𝑦𝜑)))
1615impcom 408 . . . 4 (((∃𝑦𝑥𝜑 ↔ ∃𝑥𝑦𝜑) ∧ (∃𝑦𝑦𝜑 ↔ ∃𝑦𝑥𝜑)) → (∃𝑦𝑦𝜑 ↔ ∃𝑥𝑦𝜑))
174, 13, 16sylancr 587 . . 3 (∀𝑦 𝑦 = 𝑥 → (∃𝑦𝑦𝜑 ↔ ∃𝑥𝑦𝜑))
18 bitr3 353 . . . 4 ((∃𝑦𝑦𝜑 ↔ ∃𝑥𝑦𝜑) → ((∃𝑦𝑦𝜑 ↔ ∃𝑦𝜑) → (∃𝑥𝑦𝜑 ↔ ∃𝑦𝜑)))
1918impcom 408 . . 3 (((∃𝑦𝑦𝜑 ↔ ∃𝑦𝜑) ∧ (∃𝑦𝑦𝜑 ↔ ∃𝑥𝑦𝜑)) → (∃𝑥𝑦𝜑 ↔ ∃𝑦𝜑))
203, 17, 19sylancr 587 . 2 (∀𝑦 𝑦 = 𝑥 → (∃𝑥𝑦𝜑 ↔ ∃𝑦𝜑))
211, 20syl 17 1 (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝑦𝜑 ↔ ∃𝑦𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wal 1537  wex 1782
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-ex 1783  df-nf 1787
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator