MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbcg Structured version   Visualization version   GIF version

Theorem sbcg 3810
Description: Substitution for a variable not occurring in a wff does not affect it. Distinct variable form of sbcgf 3808. (Contributed by Alan Sare, 10-Nov-2012.) Reduce axiom usage. (Revised by GG, 12-Oct-2024.)
Assertion
Ref Expression
sbcg (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝜑 ↔ 𝜑))
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝐴(𝑥)   𝑉(𝑥)

Proof of Theorem sbcg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 df-sbc 3739 . . 3 ([𝐴 / 𝑥]𝜑 ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})
2 dfclel 2836 . . 3 (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}))
3 df-clab 2739 . . . . . 6 (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
4 sbv 2124 . . . . . 6 ([𝑦 / 𝑥]𝜑 ↔ 𝜑)
53, 4bitri 278 . . . . 5 (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
65anbi2i 635 . . . 4 ((𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) ↔ (𝑦 = 𝐴 ∧ 𝜑))
76exbii 1880 . . 3 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝜑))
81, 2, 73bitrri 301 . 2 (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ [𝐴 / 𝑥]𝜑)
9 dfclel 2836 . . . 4 (𝐴 ∈ 𝑉 ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉))
109biimpi 219 . . 3 (𝐴 ∈ 𝑉 → ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉))
11 simpr 490 . . . . . 6 ((𝑦 = 𝐴 ∧ 𝜑) → 𝜑)
1211ax-gen 1827 . . . . 5 ∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑)
13 19.23v 1974 . . . . . 6 (∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑) ↔ (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
1413biimpi 219 . . . . 5 (∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
1512, 14mp1i 14 . . . 4 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
16 2a1 29 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦 ∈ 𝑉 → (𝜑 → 𝑦 = 𝐴)))
1716imp 412 . . . . . . 7 ((𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → 𝑦 = 𝐴))
1817ancrd 561 . . . . . 6 ((𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → (𝑦 = 𝐴 ∧ 𝜑)))
1918eximi 1867 . . . . 5 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → ∃𝑦(𝜑 → (𝑦 = 𝐴 ∧ 𝜑)))
20 19.37imv 1979 . . . . 5 (∃𝑦(𝜑 → (𝑦 = 𝐴 ∧ 𝜑)) → (𝜑 → ∃𝑦(𝑦 = 𝐴 ∧ 𝜑)))
2119, 20syl 18 . . . 4 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → ∃𝑦(𝑦 = 𝐴 ∧ 𝜑)))
2215, 21impbid 215 . . 3 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ 𝜑))
2310, 22syl 18 . 2 (𝐴 ∈ 𝑉 → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ 𝜑))
248, 23bitr3id 288 1 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝜑 ↔ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811  [wsb 2098   ∈ wcel 2144  {cab 2738  [wsbc 3738
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2099  df-clab 2739  df-clel 2835  df-sbc 3739
This theorem is used by:  sbcabel  3824  csbconstg  3865  2nreu  4401  csbuni  4897  csbxp  5751  sbcfungOLD  6564  fmptsnd  7174  csbfrecsg  8303  opsbc2ie  33115  f1od2  33354  bnj89  35395  bnj525  35412  bnj1128  35663  csbrdgg  38328  csboprabg  38329  mptsnunlem  38337  topdifinffinlem  38346  relowlpssretop  38363  rdgeqoa  38369  csbfinxpg  38387  gm-sbtru  39114  sbfal  39115  cdlemk40  42050  cdlemkid3N  42066  cdlemkid4  42067  frege70  45009  frege77  45016  frege116  45055  frege118  45057  trsbc  45599  trsbcVD  45935  csbxpgVD  45952  csbunigVD  45956
  Copyright terms: Public domain W3C validator