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

Theorem bnj1006 35702
Description: Technical lemma for bnj69 35752. 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
bnj1006.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1006.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1006.3 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1006.4 (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
bnj1006.5 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
bnj1006.6 (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
bnj1006.7 (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
bnj1006.8 (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
bnj1006.9 (𝜒′ ↔ [𝑝 / 𝑛]𝜒)
bnj1006.10 (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
bnj1006.11 (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
bnj1006.12 (𝜒″ ↔ [𝐺 / 𝑓]𝜒′)
bnj1006.13 𝐷 = (ω ∖ {∅})
bnj1006.15 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
bnj1006.16 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
bnj1006.28 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))
Assertion
Ref Expression
bnj1006 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
Distinct variable groups:   𝐴,𝑓,𝑖,𝑚,𝑛,𝑦   𝐷,𝑓,𝑛   𝑖,𝐺   𝑅,𝑓,𝑖,𝑚,𝑛,𝑦   𝑓,𝑋,𝑛   𝑓,𝑝,𝑖,𝑛
Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜃(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜏(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜂(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑧, 𝑝)   𝐶(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐷(𝑦, 𝑧, 𝑖, 𝑚, 𝑝)   𝑅(𝑧, 𝑝)   𝐺(𝑦, 𝑧, 𝑓, 𝑚, 𝑛, 𝑝)   𝑋(𝑦, 𝑧, 𝑖, 𝑚, 𝑝)   𝜑′(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓′(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒′(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑″(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓″(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒″(𝑦, 𝑧, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj1006
StepHypRef Expression
1 bnj1006.6 . . . . 5 (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
21simprbi 503 . . . 4 (𝜂 → 𝑦 ∈ (𝑓‘𝑖))
32bnj708 35499 . . 3 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑦 ∈ (𝑓‘𝑖))
4 bnj1006.4 . . . . . . . 8 (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
5 bnj253 35447 . . . . . . . . 9 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
65simp1bi 1164 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)) → (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
74, 6sylbi 220 . . . . . . 7 (𝜃 → (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
87bnj705 35496 . . . . . 6 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
9 bnj643 35492 . . . . . . 7 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝜒)
10 bnj1006.5 . . . . . . . . 9 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
11 3simpc 1169 . . . . . . . . 9 ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) → (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
1210, 11sylbi 220 . . . . . . . 8 (𝜏 → (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
1312bnj707 35498 . . . . . . 7 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
14 3anass 1112 . . . . . . 7 ((𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ↔ (𝜒 ∧ (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)))
159, 13, 14sylanbrc 595 . . . . . 6 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
16 bnj1006.1 . . . . . . 7 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
17 bnj1006.2 . . . . . . 7 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
18 bnj1006.3 . . . . . . 7 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
19 bnj1006.13 . . . . . . 7 𝐷 = (ω ∖ {∅})
20 bnj1006.15 . . . . . . 7 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
21 biid 264 . . . . . . 7 ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
22 biid 264 . . . . . . 7 ((𝑛 ∈ 𝐷 ∧ 𝑝 = suc 𝑛 ∧ 𝑚 ∈ 𝑛) ↔ (𝑛 ∈ 𝐷 ∧ 𝑝 = suc 𝑛 ∧ 𝑚 ∈ 𝑛))
2316, 17, 18, 19, 20, 21, 22bnj969 35688 . . . . . 6 (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝐶 ∈ V)
248, 15, 23syl2anc 596 . . . . 5 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝐶 ∈ V)
2518bnj1235 35546 . . . . . 6 (𝜒 → 𝑓 Fn 𝑛)
2625bnj706 35497 . . . . 5 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑓 Fn 𝑛)
2710simp3bi 1166 . . . . . 6 (𝜏 → 𝑝 = suc 𝑛)
2827bnj707 35498 . . . . 5 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑝 = suc 𝑛)
291simplbi 502 . . . . . 6 (𝜂 → 𝑖 ∈ 𝑛)
3029bnj708 35499 . . . . 5 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑖 ∈ 𝑛)
3124, 26, 28, 30bnj951 35518 . . . 4 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝑖 ∈ 𝑛))
32 bnj1006.16 . . . . 5 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
3332bnj945 35516 . . . 4 ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝑖 ∈ 𝑛) → (𝐺‘𝑖) = (𝑓‘𝑖))
3431, 33syl 18 . . 3 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝐺‘𝑖) = (𝑓‘𝑖))
353, 34eleqtrrd 2870 . 2 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑦 ∈ (𝐺‘𝑖))
36 bnj1006.28 . . . . 5 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))
3736anim1i 627 . . . 4 (((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ∧ 𝑦 ∈ (𝐺‘𝑖)) → ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑦 ∈ (𝐺‘𝑖)))
38 df-bnj17 35430 . . . 4 ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑦 ∈ (𝐺‘𝑖)) ↔ ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑦 ∈ (𝐺‘𝑖)))
3937, 38sylibr 237 . . 3 (((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ∧ 𝑦 ∈ (𝐺‘𝑖)) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑦 ∈ (𝐺‘𝑖)))
40 bnj1006.7 . . . 4 (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
41 bnj1006.8 . . . 4 (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
42 bnj1006.9 . . . 4 (𝜒′ ↔ [𝑝 / 𝑛]𝜒)
43 bnj1006.10 . . . 4 (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
44 bnj1006.11 . . . 4 (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
45 bnj1006.12 . . . 4 (𝜒″ ↔ [𝐺 / 𝑓]𝜒′)
4616, 17, 18, 40, 41, 42, 43, 44, 45, 20, 32bnj999 35700 . . 3 ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑦 ∈ (𝐺‘𝑖)) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
4739, 46syl 18 . 2 (((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ∧ 𝑦 ∈ (𝐺‘𝑖)) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
4835, 47mpdan 700 1 ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∀wral 3083  Vcvv 3453  [wsbc 3741   ⊆ wss 3899   ∖ cdif 4047   ∪ cun 4151  ∅c0 4280  {csn 4587  ⟨cop 4839  ∪ ciun 4955  suc csuc 6389   Fn wfn 6560  ‘cfv 6565  ωcom 7910   ∧ w-bnj17 35429   predc-bnj14 35431   FrSe w-bnj15 35435   trClc-bnj18 35437
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782  ax-reg 9622
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-res 5669  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-fv 6573  df-om 7911  df-bnj17 35430  df-bnj14 35432  df-bnj13 35434  df-bnj15 35436
This theorem is used by:  bnj1020  35707
  Copyright terms: Public domain W3C validator