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

Theorem bnj151 35274
Description: Technical lemma for bnj153 35277. 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
bnj151.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj151.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj151.3 𝐷 = (ω ∖ {∅})
bnj151.4 (𝜃 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
bnj151.5 (𝜏 ↔ ∀𝑚𝐷 (𝑚 E 𝑛[𝑚 / 𝑛]𝜃))
bnj151.6 (𝜁 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
bnj151.7 (𝜑′[1o / 𝑛]𝜑)
bnj151.8 (𝜓′[1o / 𝑛]𝜓)
bnj151.9 (𝜃′[1o / 𝑛]𝜃)
bnj151.10 (𝜃0 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃𝑓(𝑓 Fn 1o𝜑′𝜓′)))
bnj151.11 (𝜃1 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′)))
bnj151.12 (𝜁′[1o / 𝑛]𝜁)
bnj151.13 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
bnj151.14 (𝜑″[𝐹 / 𝑓]𝜑′)
bnj151.15 (𝜓″[𝐹 / 𝑓]𝜓′)
bnj151.16 (𝜁″[𝐹 / 𝑓]𝜁′)
bnj151.17 (𝜁0 ↔ (𝑓 Fn 1o𝜑′𝜓′))
bnj151.18 (𝜁1[𝑔 / 𝑓]𝜁0)
bnj151.19 (𝜑1[𝑔 / 𝑓]𝜑′)
bnj151.20 (𝜓1[𝑔 / 𝑓]𝜓′)
Assertion
Ref Expression
bnj151 (𝑛 = 1o → ((𝑛𝐷𝜏) → 𝜃))
Distinct variable groups:   𝐴,𝑓,𝑔,𝑥   𝐴,𝑛,𝑓,𝑥   𝑓,𝐹,𝑖,𝑦   𝑅,𝑓,𝑔,𝑥   𝑅,𝑛   𝑓,𝜁1   𝑔,𝜁0   𝑖,𝑛,𝑦   𝑚,𝑛
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜓(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜃(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜏(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜁(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝐴(𝑦, 𝑖, 𝑚)   𝐷(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝑅(𝑦, 𝑖, 𝑚)   𝐹(𝑥, 𝑔, 𝑚, 𝑛)   𝜑′(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜓′(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜃′(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜁′(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜑″(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜓″(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜁″(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜃0(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜁0(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝜑1(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜓1(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜃1(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑚, 𝑛)   𝜁1(𝑥, 𝑦, 𝑔, 𝑖, 𝑚, 𝑛)

Proof of Theorem bnj151
StepHypRef Expression
1 bnj151.1 . . . . . . 7 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2 bnj151.2 . . . . . . 7 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj151.6 . . . . . . 7 (𝜁 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
4 bnj151.7 . . . . . . 7 (𝜑′[1o / 𝑛]𝜑)
5 bnj151.8 . . . . . . 7 (𝜓′[1o / 𝑛]𝜓)
6 bnj151.10 . . . . . . 7 (𝜃0 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃𝑓(𝑓 Fn 1o𝜑′𝜓′)))
7 bnj151.12 . . . . . . 7 (𝜁′[1o / 𝑛]𝜁)
8 bnj151.13 . . . . . . 7 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
9 bnj151.14 . . . . . . 7 (𝜑″[𝐹 / 𝑓]𝜑′)
10 bnj151.15 . . . . . . 7 (𝜓″[𝐹 / 𝑓]𝜓′)
11 bnj151.16 . . . . . . 7 (𝜁″[𝐹 / 𝑓]𝜁′)
121, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11bnj150 35273 . . . . . 6 𝜃0
1312, 6mpbi 233 . . . . 5 ((𝑅 FrSe 𝐴𝑥𝐴) → ∃𝑓(𝑓 Fn 1o𝜑′𝜓′))
14 bnj151.11 . . . . . . 7 (𝜃1 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′)))
15 bnj151.17 . . . . . . 7 (𝜁0 ↔ (𝑓 Fn 1o𝜑′𝜓′))
16 bnj151.18 . . . . . . 7 (𝜁1[𝑔 / 𝑓]𝜁0)
17 bnj151.19 . . . . . . 7 (𝜑1[𝑔 / 𝑓]𝜑′)
18 bnj151.20 . . . . . . 7 (𝜓1[𝑔 / 𝑓]𝜓′)
191, 4bnj118 35266 . . . . . . 7 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2014, 15, 16, 17, 18, 19bnj149 35272 . . . . . 6 𝜃1
2120, 14mpbi 233 . . . . 5 ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′))
22 df-eu 2596 . . . . 5 (∃!𝑓(𝑓 Fn 1o𝜑′𝜓′) ↔ (∃𝑓(𝑓 Fn 1o𝜑′𝜓′) ∧ ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′)))
2313, 21, 22sylanbrc 594 . . . 4 ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 1o𝜑′𝜓′))
24 bnj151.4 . . . . 5 (𝜃 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
25 bnj151.9 . . . . 5 (𝜃′[1o / 𝑛]𝜃)
2624, 4, 5, 25bnj130 35271 . . . 4 (𝜃′ ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 1o𝜑′𝜓′)))
2723, 26mpbir 234 . . 3 𝜃′
28 sbceq1a 3754 . . . 4 (𝑛 = 1o → (𝜃[1o / 𝑛]𝜃))
2928, 25bitr4di 292 . . 3 (𝑛 = 1o → (𝜃𝜃′))
3027, 29mpbiri 261 . 2 (𝑛 = 1o𝜃)
3130a1d 26 1 (𝑛 = 1o → ((𝑛𝐷𝜏) → 𝜃))
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  ∃*wmo 2564  ∃!weu 2595  wral 3078  [wsbc 3743  cdif 3901  c0 4285  {csn 4588  cop 4594   ciun 4955   class class class wbr 5108   E cep 5559  suc csuc 6362   Fn wfn 6531  cfv 6536  ωcom 7860  1oc1o 8444   predc-bnj14 35086   FrSe w-bnj15 35090
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-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-1o 8451  df-bnj13 35089  df-bnj15 35091
This theorem is used by:  bnj153  35277
  Copyright terms: Public domain W3C validator