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

Theorem bnj984 31022
Description: Technical lemma for bnj69 31078. 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). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj984.3 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
bnj984.11 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
Assertion
Ref Expression
bnj984 (𝐺𝐴 → (𝐺𝐵[𝐺 / 𝑓]𝑛𝜒))

Proof of Theorem bnj984
StepHypRef Expression
1 sbc8g 3443 . . 3 (𝐺𝐴 → ([𝐺 / 𝑓]𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ↔ 𝐺 ∈ {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}))
2 bnj984.11 . . . 4 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
32eleq2i 2693 . . 3 (𝐺𝐵𝐺 ∈ {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)})
41, 3syl6rbbr 279 . 2 (𝐺𝐴 → (𝐺𝐵[𝐺 / 𝑓]𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)))
5 df-rex 2918 . . . 4 (∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∃𝑛(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)))
6 bnj984.3 . . . . 5 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
7 bnj252 30769 . . . . 5 ((𝑛𝐷𝑓 Fn 𝑛𝜑𝜓) ↔ (𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)))
86, 7bitri 264 . . . 4 (𝜒 ↔ (𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)))
95, 8bnj133 30793 . . 3 (∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∃𝑛𝜒)
109sbcbii 3491 . 2 ([𝐺 / 𝑓]𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ↔ [𝐺 / 𝑓]𝑛𝜒)
114, 10syl6bb 276 1 (𝐺𝐴 → (𝐺𝐵[𝐺 / 𝑓]𝑛𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wex 1704  wcel 1990  {cab 2608  wrex 2913  [wsbc 3435   Fn wfn 5883  w-bnj17 30752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-rex 2918  df-v 3202  df-sbc 3436  df-bnj17 30753
This theorem is referenced by:  bnj985  31023
  Copyright terms: Public domain W3C validator