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 2125 . . . . . 6 ([𝑦 / 𝑥]𝜑 ↔ 𝜑)
53, 4bitri 278 . . . . 5 (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
65anbi2i 635 . . . 4 ((𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) ↔ (𝑦 = 𝐴 ∧ 𝜑))
76exbii 1881 . . 3 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝜑))
81, 2, 73bitrri 301 . 2 (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) ↔ [𝐴 / 𝑥]𝜑)
9 dfclel 2836 . . . 4 (𝐴 ∈ 𝑉 ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉))
109biimpi 219 . . 3 (𝐴 ∈ 𝑉 → ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉))
11 simpr 490 . . . . . 6 ((𝑦 = 𝐴 ∧ 𝜑) → 𝜑)
1211ax-gen 1828 . . . . 5 ∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑)
13 19.23v 1975 . . . . . 6 (∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑) ↔ (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
1413biimpi 219 . . . . 5 (∀𝑦((𝑦 = 𝐴 ∧ 𝜑) → 𝜑) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
1512, 14mp1i 14 . . . 4 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (∃𝑦(𝑦 = 𝐴 ∧ 𝜑) → 𝜑))
16 2a1 29 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦 ∈ 𝑉 → (𝜑 → 𝑦 = 𝐴)))
1716imp 412 . . . . . . 7 ((𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → 𝑦 = 𝐴))
1817ancrd 561 . . . . . 6 ((𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → (𝜑 → (𝑦 = 𝐴 ∧ 𝜑)))
1918eximi 1868 . . . . 5 (∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ 𝑉) → ∃𝑦(𝜑 → (𝑦 = 𝐴 ∧ 𝜑)))
20 19.37imv 1980 . . . . 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 1568   = wceq 1570  ∃wex 1812  [wsb 2099   ∈ wcel 2145  {cab 2738  [wsbc 3738
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2739  df-clel 2835  df-sbc 3739
This theorem is used by:  sbcabel  3824  csbconstg  3865  2nreu  4401  csbuni  4897  csbxp  5748  sbcfungOLD  6552  fmptsnd  7162  csbfrecsg  8280  opsbc2ie  33006  f1od2  33245  bnj89  35287  bnj525  35304  bnj1128  35555  csbrdgg  38172  csboprabg  38173  mptsnunlem  38181  topdifinffinlem  38190  relowlpssretop  38207  rdgeqoa  38213  csbfinxpg  38231  gm-sbtru  38958  sbfal  38959  cdlemk40  41894  cdlemkid3N  41910  cdlemkid4  41911  frege70  44877  frege77  44884  frege116  44923  frege118  44925  trsbc  45467  trsbcVD  45803  csbxpgVD  45820  csbunigVD  45824
  Copyright terms: Public domain W3C validator