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

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

Proof of Theorem bnj557
StepHypRef Expression
1 3an4anass 1122 . . . . 5 (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) ∧ 𝜁) ↔ ((𝑅 FrSe 𝐴 ∧ 𝜏) ∧ (𝜂 ∧ 𝜁)))
2 bnj557.18 . . . . . . . 8 (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
3 bnj557.19 . . . . . . . 8 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
42, 3bnj556 35530 . . . . . . 7 (𝜂 → 𝜎)
543anim3i 1172 . . . . . 6 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎))
6 bnj557.20 . . . . . . 7 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
7 vex 3454 . . . . . . . 8 𝑖 ∈ V
87bnj216 35363 . . . . . . 7 (𝑚 = suc 𝑖 → 𝑖 ∈ 𝑚)
96, 8bnj837 35392 . . . . . 6 (𝜁 → 𝑖 ∈ 𝑚)
105, 9anim12i 625 . . . . 5 (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) ∧ 𝜁) → ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚))
111, 10sylbir 238 . . . 4 (((𝑅 FrSe 𝐴 ∧ 𝜏) ∧ (𝜂 ∧ 𝜁)) → ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚))
123bnj1254 35439 . . . . . 6 (𝜂 → 𝑚 = suc 𝑝)
136simp3bi 1165 . . . . . 6 (𝜁 → 𝑚 = suc 𝑖)
14 bnj551 35373 . . . . . 6 ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → 𝑝 = 𝑖)
1512, 13, 14syl2an 608 . . . . 5 ((𝜂 ∧ 𝜁) → 𝑝 = 𝑖)
1615adantl 487 . . . 4 (((𝑅 FrSe 𝐴 ∧ 𝜏) ∧ (𝜂 ∧ 𝜁)) → 𝑝 = 𝑖)
1711, 16jca 521 . . 3 (((𝑅 FrSe 𝐴 ∧ 𝜏) ∧ (𝜂 ∧ 𝜁)) → (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) ∧ 𝑝 = 𝑖))
18 bnj256 35337 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) ↔ ((𝑅 FrSe 𝐴 ∧ 𝜏) ∧ (𝜂 ∧ 𝜁)))
19 df-3an 1105 . . 3 (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) ↔ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) ∧ 𝑝 = 𝑖))
2017, 18, 193imtr4i 295 . 2 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖))
21 bnj557.28 . . 3 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
22 bnj557.29 . . 3 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
23 bnj557.3 . . 3 𝐷 = (ω ∖ {∅})
24 bnj557.16 . . 3 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
25 bnj557.17 . . 3 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
26 bnj557.22 . . 3 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
27 bnj557.25 . . 3 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
28 bnj557.21 . . 3 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
29 bnj557.23 . . 3 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
30 bnj557.24 . . 3 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
31 bnj557.36 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)
3221, 22, 23, 24, 25, 2, 26, 27, 28, 29, 30, 31bnj553 35528 . 2 (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐿)
3320, 32syl 18 1 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → (𝐺‘𝑚) = 𝐿)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ∖ cdif 4045   ∪ cun 4149  ∅c0 4278  {csn 4583  ⟨cop 4589  ∪ ciun 4950  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   ∧ w-bnj17 35317   predc-bnj14 35319   FrSe w-bnj15 35323
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390  ax-un 7751  ax-reg 9586
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-id 5545  df-eprel 5550  df-fr 5603  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-res 5662  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-bnj17 35318
This theorem is used by:  bnj558  35532
  Copyright terms: Public domain W3C validator