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

Theorem bnj986 35352
Description: Technical lemma for bnj69 35407. 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
bnj986.3 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
bnj986.10 𝐷 = (ω ∖ {∅})
bnj986.15 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛))
Assertion
Ref Expression
bnj986 (𝜒 → ∃𝑚𝑝𝜏)
Distinct variable group:   𝑚,𝑛,𝑝
Allowed substitution hints:   𝜑(𝑓, 𝑚, 𝑛, 𝑝)   𝜓(𝑓, 𝑚, 𝑛, 𝑝)   𝜒(𝑓, 𝑚, 𝑛, 𝑝)   𝜏(𝑓, 𝑚, 𝑛, 𝑝)   𝐷(𝑓, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj986
StepHypRef Expression
1 bnj986.3 . . . . . 6 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
2 bnj986.10 . . . . . . 7 𝐷 = (ω ∖ {∅})
32bnj158 35127 . . . . . 6 (𝑛𝐷 → ∃𝑚 ∈ ω 𝑛 = suc 𝑚)
41, 3bnj769 35160 . . . . 5 (𝜒 → ∃𝑚 ∈ ω 𝑛 = suc 𝑚)
54bnj1196 35191 . . . 4 (𝜒 → ∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚))
6 vex 3458 . . . . . 6 𝑛 ∈ V
76sucex 7803 . . . . 5 suc 𝑛 ∈ V
87isseti 3472 . . . 4 𝑝 𝑝 = suc 𝑛
95, 8jctir 529 . . 3 (𝜒 → (∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛))
10 exdistr 1983 . . . 4 (∃𝑚𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛) ↔ ∃𝑚((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛))
11 19.41v 1978 . . . 4 (∃𝑚((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛) ↔ (∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛))
1210, 11bitr2i 279 . . 3 ((∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛) ↔ ∃𝑚𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
139, 12sylib 221 . 2 (𝜒 → ∃𝑚𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
14 bnj986.15 . . . 4 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛))
15 df-3an 1104 . . . 4 ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛) ↔ ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
1614, 15bitri 278 . . 3 (𝜏 ↔ ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
17162exbii 1878 . 2 (∃𝑚𝑝𝜏 ↔ ∃𝑚𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
1813, 17sylibr 237 1 (𝜒 → ∃𝑚𝑝𝜏)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wex 1808  wcel 2142  wrex 3088  cdif 3901  c0 4285  {csn 4588  suc csuc 6362   Fn wfn 6531  ωcom 7860  w-bnj17 35084
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-tr 5218  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-om 7861  df-bnj17 35085
This theorem is used by:  bnj996  35353
  Copyright terms: Public domain W3C validator