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

Theorem sbnfc2 4396
Description: Two ways of expressing "𝑥 is (effectively) not free in 𝐴". (Contributed by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
sbnfc2 (Ⅎ𝑥𝐴 ↔ ∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
Distinct variable groups:   𝑥,𝑦,𝑧   𝑦,𝐴,𝑧
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem sbnfc2
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 vex 3454 . . . . 5 𝑦 ∈ V
2 csbtt 3863 . . . . 5 ((𝑦 ∈ V ∧ Ⅎ𝑥𝐴) → ⦋𝑦 / 𝑥⦌𝐴 = 𝐴)
31, 2mpan 703 . . . 4 (Ⅎ𝑥𝐴 → ⦋𝑦 / 𝑥⦌𝐴 = 𝐴)
4 vex 3454 . . . . 5 𝑧 ∈ V
5 csbtt 3863 . . . . 5 ((𝑧 ∈ V ∧ Ⅎ𝑥𝐴) → ⦋𝑧 / 𝑥⦌𝐴 = 𝐴)
64, 5mpan 703 . . . 4 (Ⅎ𝑥𝐴 → ⦋𝑧 / 𝑥⦌𝐴 = 𝐴)
73, 6eqtr4d 2798 . . 3 (Ⅎ𝑥𝐴 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
87alrimivv 1961 . 2 (Ⅎ𝑥𝐴 → ∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
9 nfv 1947 . . 3 Ⅎ𝑤∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴
10 eleq2 2849 . . . . . 6 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → (𝑤 ∈ ⦋𝑦 / 𝑥⦌𝐴 ↔ 𝑤 ∈ ⦋𝑧 / 𝑥⦌𝐴))
11 sbsbc 3742 . . . . . . 7 ([𝑦 / 𝑥]𝑤 ∈ 𝐴 ↔ [𝑦 / 𝑥]𝑤 ∈ 𝐴)
12 sbcel2 4375 . . . . . . 7 ([𝑦 / 𝑥]𝑤 ∈ 𝐴 ↔ 𝑤 ∈ ⦋𝑦 / 𝑥⦌𝐴)
1311, 12bitri 278 . . . . . 6 ([𝑦 / 𝑥]𝑤 ∈ 𝐴 ↔ 𝑤 ∈ ⦋𝑦 / 𝑥⦌𝐴)
14 sbsbc 3742 . . . . . . 7 ([𝑧 / 𝑥]𝑤 ∈ 𝐴 ↔ [𝑧 / 𝑥]𝑤 ∈ 𝐴)
15 sbcel2 4375 . . . . . . 7 ([𝑧 / 𝑥]𝑤 ∈ 𝐴 ↔ 𝑤 ∈ ⦋𝑧 / 𝑥⦌𝐴)
1614, 15bitri 278 . . . . . 6 ([𝑧 / 𝑥]𝑤 ∈ 𝐴 ↔ 𝑤 ∈ ⦋𝑧 / 𝑥⦌𝐴)
1710, 13, 163bitr4g 317 . . . . 5 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ([𝑦 / 𝑥]𝑤 ∈ 𝐴 ↔ [𝑧 / 𝑥]𝑤 ∈ 𝐴))
18172alimi 1845 . . . 4 (∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ∀𝑦∀𝑧([𝑦 / 𝑥]𝑤 ∈ 𝐴 ↔ [𝑧 / 𝑥]𝑤 ∈ 𝐴))
19 sbnf2 2387 . . . 4 (Ⅎ𝑥 𝑤 ∈ 𝐴 ↔ ∀𝑦∀𝑧([𝑦 / 𝑥]𝑤 ∈ 𝐴 ↔ [𝑧 / 𝑥]𝑤 ∈ 𝐴))
2018, 19sylibr 237 . . 3 (∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → Ⅎ𝑥 𝑤 ∈ 𝐴)
219, 20nfcd 2915 . 2 (∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → Ⅎ𝑥𝐴)
228, 21impbii 212 1 (Ⅎ𝑥𝐴 ↔ ∀𝑦∀𝑧⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1568   = wceq 1570  Ⅎwnf 1816  [wsb 2099   ∈ wcel 2145  Ⅎwnfc 2907  Vcvv 3450  [wsbc 3738  ⦋csb 3846
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  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-nul 4279
This theorem is used by:  eusvnf  5353
  Copyright terms: Public domain W3C validator