Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj985 Structured version   Visualization version   GIF version

Theorem bnj985 35450
Description: Technical lemma for bnj69 35506. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). See bnj985v 35449 for a version with more disjoint variable conditions, not requiring ax-13 2403. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj985.3 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
bnj985.6 (𝜒′[𝑝 / 𝑛]𝜒)
bnj985.9 (𝜒″[𝐺 / 𝑓]𝜒′)
bnj985.11 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
bnj985.13 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
Assertion
Ref Expression
bnj985 (𝐺𝐵 ↔ ∃𝑝𝜒″)
Distinct variable groups:   𝐺,𝑝   𝜒,𝑝   𝑓,𝑝
Allowed substitution hints:   𝜑(𝑓, 𝑛, 𝑝)   𝜓(𝑓, 𝑛, 𝑝)   𝜒(𝑓, 𝑛)   𝐵(𝑓, 𝑛, 𝑝)   𝐶(𝑓, 𝑛, 𝑝)   𝐷(𝑓, 𝑛, 𝑝)   𝐺(𝑓, 𝑛)   𝜒′(𝑓, 𝑛, 𝑝)   𝜒″(𝑓, 𝑛, 𝑝)

Proof of Theorem bnj985
StepHypRef Expression
1 bnj985.13 . . . 4 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
21bnj918 35263 . . 3 𝐺 ∈ V
3 bnj985.3 . . . 4 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
4 bnj985.11 . . . 4 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
53, 4bnj984 35448 . . 3 (𝐺 ∈ V → (𝐺𝐵[𝐺 / 𝑓]𝑛𝜒))
62, 5ax-mp 5 . 2 (𝐺𝐵[𝐺 / 𝑓]𝑛𝜒)
7 sbcex2 3802 . . 3 ([𝐺 / 𝑓]𝑝𝜒′ ↔ ∃𝑝[𝐺 / 𝑓]𝜒′)
8 nfv 1947 . . . . . . 7 𝑝𝜒
98sb8e 2549 . . . . . 6 (∃𝑛𝜒 ↔ ∃𝑝[𝑝 / 𝑛]𝜒)
10 sbsbc 3746 . . . . . . 7 ([𝑝 / 𝑛]𝜒[𝑝 / 𝑛]𝜒)
1110exbii 1881 . . . . . 6 (∃𝑝[𝑝 / 𝑛]𝜒 ↔ ∃𝑝[𝑝 / 𝑛]𝜒)
129, 11bitri 278 . . . . 5 (∃𝑛𝜒 ↔ ∃𝑝[𝑝 / 𝑛]𝜒)
13 bnj985.6 . . . . 5 (𝜒′[𝑝 / 𝑛]𝜒)
1412, 13bnj133 35224 . . . 4 (∃𝑛𝜒 ↔ ∃𝑝𝜒′)
1514sbcbii 3798 . . 3 ([𝐺 / 𝑓]𝑛𝜒[𝐺 / 𝑓]𝑝𝜒′)
16 bnj985.9 . . . 4 (𝜒″[𝐺 / 𝑓]𝜒′)
1716exbii 1881 . . 3 (∃𝑝𝜒″ ↔ ∃𝑝[𝐺 / 𝑓]𝜒′)
187, 15, 173bitr4i 306 . 2 ([𝐺 / 𝑓]𝑛𝜒 ↔ ∃𝑝𝜒″)
196, 18bitri 278 1 (𝐺𝐵 ↔ ∃𝑝𝜒″)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  w3a 1103   = wceq 1570  wex 1812  [wsb 2099  wcel 2145  {cab 2740  wrex 3088  Vcvv 3453  [wsbc 3742  cun 3900  {csn 4587  cop 4593   Fn wfn 6532  w-bnj17 35183
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 2215  ax-13 2403  ax-ext 2734  ax-sep 5255  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rex 3089  df-v 3455  df-sbc 3743  df-un 3907  df-ss 3919  df-sn 4588  df-pr 4590  df-uni 4871  df-bnj17 35184
This theorem is used by:  bnj1018g  35459
  Copyright terms: Public domain W3C validator