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

Theorem dvelimor 1969
Description: Disjunctive distinct variable constraint elimination. A user of this theorem starts with a formula 𝜑 (containing 𝑧) and a distinct variable constraint between 𝑥 and 𝑧. The theorem makes it possible to replace the distinct variable constraint with the disjunct 𝑥𝑥 = 𝑦 (𝜓 is just a version of 𝜑 with 𝑦 substituted for 𝑧). (Contributed by Jim Kingdon, 11-May-2018.)
Hypotheses
Ref Expression
dvelimor.1 𝑥𝜑
dvelimor.2 (𝑧 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
dvelimor (∀𝑥 𝑥 = 𝑦 ∨ Ⅎ𝑥𝜓)
Distinct variable groups:   𝜓,𝑧   𝑥,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦)

Proof of Theorem dvelimor
StepHypRef Expression
1 ax-bndl 1469 . . . . . 6 (∀𝑥 𝑥 = 𝑧 ∨ (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)))
2 orcom 700 . . . . . . 7 ((∀𝑥 𝑥 = 𝑦 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) ↔ (∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) ∨ ∀𝑥 𝑥 = 𝑦))
32orbi2i 734 . . . . . 6 ((∀𝑥 𝑥 = 𝑧 ∨ (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))) ↔ (∀𝑥 𝑥 = 𝑧 ∨ (∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) ∨ ∀𝑥 𝑥 = 𝑦)))
41, 3mpbi 144 . . . . 5 (∀𝑥 𝑥 = 𝑧 ∨ (∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) ∨ ∀𝑥 𝑥 = 𝑦))
5 orass 739 . . . . 5 (((∀𝑥 𝑥 = 𝑧 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) ∨ ∀𝑥 𝑥 = 𝑦) ↔ (∀𝑥 𝑥 = 𝑧 ∨ (∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) ∨ ∀𝑥 𝑥 = 𝑦)))
64, 5mpbir 145 . . . 4 ((∀𝑥 𝑥 = 𝑧 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) ∨ ∀𝑥 𝑥 = 𝑦)
7 nfae 1680 . . . . . . 7 𝑧𝑥 𝑥 = 𝑧
8 a16nf 1820 . . . . . . 7 (∀𝑥 𝑥 = 𝑧 → Ⅎ𝑥(𝑧 = 𝑦𝜑))
97, 8alrimi 1485 . . . . . 6 (∀𝑥 𝑥 = 𝑧 → ∀𝑧𝑥(𝑧 = 𝑦𝜑))
10 df-nf 1420 . . . . . . . 8 (Ⅎ𝑥 𝑧 = 𝑦 ↔ ∀𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))
11 id 19 . . . . . . . . 9 (Ⅎ𝑥 𝑧 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦)
12 dvelimor.1 . . . . . . . . . 10 𝑥𝜑
1312a1i 9 . . . . . . . . 9 (Ⅎ𝑥 𝑧 = 𝑦 → Ⅎ𝑥𝜑)
1411, 13nfimd 1547 . . . . . . . 8 (Ⅎ𝑥 𝑧 = 𝑦 → Ⅎ𝑥(𝑧 = 𝑦𝜑))
1510, 14sylbir 134 . . . . . . 7 (∀𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) → Ⅎ𝑥(𝑧 = 𝑦𝜑))
1615alimi 1414 . . . . . 6 (∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) → ∀𝑧𝑥(𝑧 = 𝑦𝜑))
179, 16jaoi 688 . . . . 5 ((∀𝑥 𝑥 = 𝑧 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) → ∀𝑧𝑥(𝑧 = 𝑦𝜑))
1817orim1i 732 . . . 4 (((∀𝑥 𝑥 = 𝑧 ∨ ∀𝑧𝑥(𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) ∨ ∀𝑥 𝑥 = 𝑦) → (∀𝑧𝑥(𝑧 = 𝑦𝜑) ∨ ∀𝑥 𝑥 = 𝑦))
196, 18ax-mp 5 . . 3 (∀𝑧𝑥(𝑧 = 𝑦𝜑) ∨ ∀𝑥 𝑥 = 𝑦)
20 orcom 700 . . 3 ((∀𝑧𝑥(𝑧 = 𝑦𝜑) ∨ ∀𝑥 𝑥 = 𝑦) ↔ (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑧𝑥(𝑧 = 𝑦𝜑)))
2119, 20mpbi 144 . 2 (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑧𝑥(𝑧 = 𝑦𝜑))
22 nfalt 1540 . . . 4 (∀𝑧𝑥(𝑧 = 𝑦𝜑) → Ⅎ𝑥𝑧(𝑧 = 𝑦𝜑))
23 ax-17 1489 . . . . . 6 (𝜓 → ∀𝑧𝜓)
24 dvelimor.2 . . . . . 6 (𝑧 = 𝑦 → (𝜑𝜓))
2523, 24equsalh 1687 . . . . 5 (∀𝑧(𝑧 = 𝑦𝜑) ↔ 𝜓)
2625nfbii 1432 . . . 4 (Ⅎ𝑥𝑧(𝑧 = 𝑦𝜑) ↔ Ⅎ𝑥𝜓)
2722, 26sylib 121 . . 3 (∀𝑧𝑥(𝑧 = 𝑦𝜑) → Ⅎ𝑥𝜓)
2827orim2i 733 . 2 ((∀𝑥 𝑥 = 𝑦 ∨ ∀𝑧𝑥(𝑧 = 𝑦𝜑)) → (∀𝑥 𝑥 = 𝑦 ∨ Ⅎ𝑥𝜓))
2921, 28ax-mp 5 1 (∀𝑥 𝑥 = 𝑦 ∨ Ⅎ𝑥𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wb 104  wo 680  wal 1312  wnf 1419
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-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498
This theorem depends on definitions:  df-bi 116  df-nf 1420  df-sb 1719
This theorem is referenced by:  nfsb4or  1974  rgen2a  2461
  Copyright terms: Public domain W3C validator