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

Theorem sbciegft 2762
 Description: Conversion of implicit substitution to explicit class substitution, using a bound-variable hypothesis instead of distinct variables. (Closed theorem version of sbciegf 2763.) (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 13-Oct-2016.)
Assertion
Ref Expression
sbciegft ((A 𝑉 xψ x(x = A → (φψ))) → ([A / x]φψ))
Distinct variable group:   x,A
Allowed substitution hints:   φ(x)   ψ(x)   𝑉(x)

Proof of Theorem sbciegft
StepHypRef Expression
1 sbc5 2756 . . 3 ([A / x]φx(x = A φ))
2 bi1 111 . . . . . . . 8 ((φψ) → (φψ))
32imim2i 12 . . . . . . 7 ((x = A → (φψ)) → (x = A → (φψ)))
43impd 242 . . . . . 6 ((x = A → (φψ)) → ((x = A φ) → ψ))
54alimi 1318 . . . . 5 (x(x = A → (φψ)) → x((x = A φ) → ψ))
6 19.23t 1541 . . . . . 6 (Ⅎxψ → (x((x = A φ) → ψ) ↔ (x(x = A φ) → ψ)))
76biimpa 280 . . . . 5 ((Ⅎxψ x((x = A φ) → ψ)) → (x(x = A φ) → ψ))
85, 7sylan2 270 . . . 4 ((Ⅎxψ x(x = A → (φψ))) → (x(x = A φ) → ψ))
983adant1 904 . . 3 ((A 𝑉 xψ x(x = A → (φψ))) → (x(x = A φ) → ψ))
101, 9syl5bi 141 . 2 ((A 𝑉 xψ x(x = A → (φψ))) → ([A / x]φψ))
11 bi2 121 . . . . . . . 8 ((φψ) → (ψφ))
1211imim2i 12 . . . . . . 7 ((x = A → (φψ)) → (x = A → (ψφ)))
1312com23 72 . . . . . 6 ((x = A → (φψ)) → (ψ → (x = Aφ)))
1413alimi 1318 . . . . 5 (x(x = A → (φψ)) → x(ψ → (x = Aφ)))
15 19.21t 1448 . . . . . 6 (Ⅎxψ → (x(ψ → (x = Aφ)) ↔ (ψx(x = Aφ))))
1615biimpa 280 . . . . 5 ((Ⅎxψ x(ψ → (x = Aφ))) → (ψx(x = Aφ)))
1714, 16sylan2 270 . . . 4 ((Ⅎxψ x(x = A → (φψ))) → (ψx(x = Aφ)))
18173adant1 904 . . 3 ((A 𝑉 xψ x(x = A → (φψ))) → (ψx(x = Aφ)))
19 sbc6g 2757 . . . 4 (A 𝑉 → ([A / x]φx(x = Aφ)))
20193ad2ant1 907 . . 3 ((A 𝑉 xψ x(x = A → (φψ))) → ([A / x]φx(x = Aφ)))
2118, 20sylibrd 158 . 2 ((A 𝑉 xψ x(x = A → (φψ))) → (ψ[A / x]φ))
2210, 21impbid 120 1 ((A 𝑉 xψ x(x = A → (φψ))) → ([A / x]φψ))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   ∧ w3a 867  ∀wal 1222   = wceq 1224  Ⅎwnf 1323  ∃wex 1355   ∈ wcel 1367  [wsbc 2733 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-io 614  ax-5 1310  ax-7 1311  ax-gen 1312  ax-ie1 1356  ax-ie2 1357  ax-8 1369  ax-10 1370  ax-11 1371  ax-i12 1372  ax-bnd 1373  ax-4 1374  ax-17 1393  ax-i9 1397  ax-ial 1401  ax-i5r 1402  ax-ext 1996 This theorem depends on definitions:  df-bi 110  df-3an 869  df-tru 1227  df-nf 1324  df-sb 1620  df-clab 2001  df-cleq 2007  df-clel 2010  df-nfc 2141  df-v 2529  df-sbc 2734 This theorem is referenced by:  sbciegf  2763  sbciedf  2767
 Copyright terms: Public domain W3C validator