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 35574
Description: Technical lemma for bnj153 35577. 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 35573 . . . . . 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 35566 . . . . . . 7 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2014, 15, 16, 17, 18, 19bnj149 35572 . . . . . 6 𝜃1
2120, 14mpbi 233 . . . . 5 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
22 df-eu 2597 . . . . 5 (∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ (∃𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ∧ ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
2313, 21, 22sylanbrc 595 . . . 4 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
24 bnj151.4 . . . . 5 (𝜃 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
25 bnj151.9 . . . . 5 (𝜃′ ↔ [1o / 𝑛]𝜃)
2624, 4, 5, 25bnj130 35571 . . . 4 (𝜃′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
2723, 26mpbir 234 . . 3 𝜃′
28 sbceq1a 3753 . . . 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 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃*wmo 2565  ∃!weu 2596  ∀wral 3080  [wsbc 3742   ∖ cdif 4048  ∅c0 4281  {csn 4588  ⟨cop 4838  ∪ ciun 4954   class class class wbr 5106   E cep 5554  suc csuc 6379   Fn wfn 6550  ‘cfv 6555  ωcom 7898  1oc1o 8494   predc-bnj14 35386   FrSe w-bnj15 35390
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-1o 8501  df-bnj13 35389  df-bnj15 35391
This theorem is used by:  bnj153  35577
  Copyright terms: Public domain W3C validator