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

Theorem bnj558 35398
Description: Technical lemma for bnj852 35417. 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
bnj558.3 𝐷 = (ω ∖ {∅})
bnj558.16 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj558.17 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
bnj558.18 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
bnj558.19 (𝜂 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj558.20 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖𝑛𝑚 = suc 𝑖))
bnj558.21 𝐵 = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)
bnj558.22 𝐶 = 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)
bnj558.23 𝐾 = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅)
bnj558.24 𝐿 = 𝑦 ∈ (𝐺𝑝) pred(𝑦, 𝐴, 𝑅)
bnj558.25 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
bnj558.28 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj558.29 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj558.36 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
Assertion
Ref Expression
bnj558 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) → (𝐺‘suc 𝑖) = 𝐾)
Distinct variable groups:   𝐴,𝑖,𝑝,𝑦   𝑦,𝐺   𝑅,𝑖,𝑝,𝑦   𝑓,𝑖,𝑝,𝑦   𝑖,𝑚,𝑝   𝑝,𝜑′
Allowed substitution hints:   𝜏(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜂(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜁(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜎(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑥, 𝑓, 𝑚, 𝑛)   𝐵(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐶(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐷(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝑅(𝑥, 𝑓, 𝑚, 𝑛)   𝐺(𝑥, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐾(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐿(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑′(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝜓′(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj558
StepHypRef Expression
1 bnj558.3 . . 3 𝐷 = (ω ∖ {∅})
2 bnj558.16 . . 3 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
3 bnj558.17 . . 3 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
4 bnj558.18 . . 3 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
5 bnj558.19 . . 3 (𝜂 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
6 bnj558.20 . . 3 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖𝑛𝑚 = suc 𝑖))
7 bnj558.21 . . 3 𝐵 = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)
8 bnj558.22 . . 3 𝐶 = 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)
9 bnj558.23 . . 3 𝐾 = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅)
10 bnj558.24 . . 3 𝐿 = 𝑦 ∈ (𝐺𝑝) pred(𝑦, 𝐴, 𝑅)
11 bnj558.25 . . 3 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
12 bnj558.28 . . 3 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
13 bnj558.29 . . 3 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
14 bnj558.36 . . 3 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14bnj557 35397 . 2 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) → (𝐺𝑚) = 𝐿)
16 bnj422 35212 . . . . 5 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) ↔ (𝜂𝜁𝑅 FrSe 𝐴𝜏))
17 bnj253 35201 . . . . 5 ((𝜂𝜁𝑅 FrSe 𝐴𝜏) ↔ ((𝜂𝜁) ∧ 𝑅 FrSe 𝐴𝜏))
1816, 17bitri 278 . . . 4 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) ↔ ((𝜂𝜁) ∧ 𝑅 FrSe 𝐴𝜏))
1918simp1bi 1163 . . 3 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) → (𝜂𝜁))
205, 6, 9, 10, 9, 10bnj554 35395 . . 3 ((𝜂𝜁) → ((𝐺𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾))
2119, 20syl 18 . 2 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) → ((𝐺𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾))
2215, 21mpbid 235 1 ((𝑅 FrSe 𝐴𝜏𝜂𝜁) → (𝐺‘suc 𝑖) = 𝐾)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3078  cdif 3899  cun 3900  c0 4282  {csn 4587  cop 4593   ciun 4954  suc csuc 6363   Fn wfn 6532  cfv 6537  ωcom 7865  w-bnj17 35183   predc-bnj14 35185   FrSe w-bnj15 35189
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-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402  ax-un 7739  ax-reg 9567
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-id 5554  df-eprel 5559  df-fr 5612  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-res 5671  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-bnj17 35184
This theorem is used by:  bnj571  35402
  Copyright terms: Public domain W3C validator