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

Theorem sbciegft 2985
Description: Conversion of implicit substitution to explicit class substitution, using a bound-variable hypothesis instead of distinct variables. (Closed theorem version of sbciegf 2986.) (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 13-Oct-2016.)
Assertion
Ref Expression
sbciegft ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → ([𝐴 / 𝑥]𝜑𝜓))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)   𝑉(𝑥)

Proof of Theorem sbciegft
StepHypRef Expression
1 sbc5 2978 . . 3 ([𝐴 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝐴𝜑))
2 biimp 117 . . . . . . . 8 ((𝜑𝜓) → (𝜑𝜓))
32imim2i 12 . . . . . . 7 ((𝑥 = 𝐴 → (𝜑𝜓)) → (𝑥 = 𝐴 → (𝜑𝜓)))
43impd 252 . . . . . 6 ((𝑥 = 𝐴 → (𝜑𝜓)) → ((𝑥 = 𝐴𝜑) → 𝜓))
54alimi 1448 . . . . 5 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → ∀𝑥((𝑥 = 𝐴𝜑) → 𝜓))
6 19.23t 1670 . . . . . 6 (Ⅎ𝑥𝜓 → (∀𝑥((𝑥 = 𝐴𝜑) → 𝜓) ↔ (∃𝑥(𝑥 = 𝐴𝜑) → 𝜓)))
76biimpa 294 . . . . 5 ((Ⅎ𝑥𝜓 ∧ ∀𝑥((𝑥 = 𝐴𝜑) → 𝜓)) → (∃𝑥(𝑥 = 𝐴𝜑) → 𝜓))
85, 7sylan2 284 . . . 4 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → (∃𝑥(𝑥 = 𝐴𝜑) → 𝜓))
983adant1 1010 . . 3 ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → (∃𝑥(𝑥 = 𝐴𝜑) → 𝜓))
101, 9syl5bi 151 . 2 ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → ([𝐴 / 𝑥]𝜑𝜓))
11 biimpr 129 . . . . . . . 8 ((𝜑𝜓) → (𝜓𝜑))
1211imim2i 12 . . . . . . 7 ((𝑥 = 𝐴 → (𝜑𝜓)) → (𝑥 = 𝐴 → (𝜓𝜑)))
1312com23 78 . . . . . 6 ((𝑥 = 𝐴 → (𝜑𝜓)) → (𝜓 → (𝑥 = 𝐴𝜑)))
1413alimi 1448 . . . . 5 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → ∀𝑥(𝜓 → (𝑥 = 𝐴𝜑)))
15 19.21t 1575 . . . . . 6 (Ⅎ𝑥𝜓 → (∀𝑥(𝜓 → (𝑥 = 𝐴𝜑)) ↔ (𝜓 → ∀𝑥(𝑥 = 𝐴𝜑))))
1615biimpa 294 . . . . 5 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝜓 → (𝑥 = 𝐴𝜑))) → (𝜓 → ∀𝑥(𝑥 = 𝐴𝜑)))
1714, 16sylan2 284 . . . 4 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → (𝜓 → ∀𝑥(𝑥 = 𝐴𝜑)))
18173adant1 1010 . . 3 ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → (𝜓 → ∀𝑥(𝑥 = 𝐴𝜑)))
19 sbc6g 2979 . . . 4 (𝐴𝑉 → ([𝐴 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝐴𝜑)))
20193ad2ant1 1013 . . 3 ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → ([𝐴 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝐴𝜑)))
2118, 20sylibrd 168 . 2 ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → (𝜓[𝐴 / 𝑥]𝜑))
2210, 21impbid 128 1 ((𝐴𝑉 ∧ Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓))) → ([𝐴 / 𝑥]𝜑𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 973  wal 1346   = wceq 1348  wnf 1453  wex 1485  wcel 2141  [wsbc 2955
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-sbc 2956
This theorem is referenced by:  sbciegf  2986  sbciedf  2990
  Copyright terms: Public domain W3C validator