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

Theorem oprabidlem 5536
Description: Slight elaboration of exdistrfor 1681. A lemma for oprabid 5537. (Contributed by Jim Kingdon, 15-Jan-2019.)
Assertion
Ref Expression
oprabidlem (∃𝑥𝑦(𝑥 = 𝑧𝜓) → ∃𝑥(𝑥 = 𝑧 ∧ ∃𝑦𝜓))
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧
Allowed substitution hints:   𝜓(𝑥,𝑦,𝑧)

Proof of Theorem oprabidlem
StepHypRef Expression
1 ax-bndl 1399 . . 3 (∀𝑦 𝑦 = 𝑥 ∨ (∀𝑦 𝑦 = 𝑧 ∨ ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)))
2 ax-10 1396 . . . 4 (∀𝑦 𝑦 = 𝑥 → ∀𝑥 𝑥 = 𝑦)
3 dtru 4284 . . . . . 6 ¬ ∀𝑦 𝑦 = 𝑧
4 pm2.53 641 . . . . . 6 ((∀𝑦 𝑦 = 𝑧 ∨ ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)) → (¬ ∀𝑦 𝑦 = 𝑧 → ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)))
53, 4mpi 15 . . . . 5 ((∀𝑦 𝑦 = 𝑧 ∨ ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)) → ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧))
6 df-nf 1350 . . . . . 6 (Ⅎ𝑦 𝑥 = 𝑧 ↔ ∀𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧))
76albii 1359 . . . . 5 (∀𝑥𝑦 𝑥 = 𝑧 ↔ ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧))
85, 7sylibr 137 . . . 4 ((∀𝑦 𝑦 = 𝑧 ∨ ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)) → ∀𝑥𝑦 𝑥 = 𝑧)
92, 8orim12i 676 . . 3 ((∀𝑦 𝑦 = 𝑥 ∨ (∀𝑦 𝑦 = 𝑧 ∨ ∀𝑥𝑦(𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧))) → (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑥𝑦 𝑥 = 𝑧))
101, 9ax-mp 7 . 2 (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑥𝑦 𝑥 = 𝑧)
1110exdistrfor 1681 1 (∃𝑥𝑦(𝑥 = 𝑧𝜓) → ∃𝑥(𝑥 = 𝑧 ∧ ∃𝑦𝜓))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 97  wo 629  wal 1241  wnf 1349  wex 1381
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-setind 4262
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-v 2559  df-dif 2920  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381
This theorem is referenced by:  oprabid  5537
  Copyright terms: Public domain W3C validator