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 34805
Description: Technical lemma for bnj69 34855. 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 495 . . . 4 (𝜂𝑦 ∈ (𝑓𝑖))
32bnj708 34601 . . 3 ((𝜃𝜒𝜏𝜂) → 𝑦 ∈ (𝑓𝑖))
4 bnj1006.4 . . . . . . . 8 (𝜃 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
5 bnj253 34549 . . . . . . . . 9 ((𝑅 FrSe 𝐴𝑋𝐴𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
65simp1bi 1142 . . . . . . . 8 ((𝑅 FrSe 𝐴𝑋𝐴𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)) → (𝑅 FrSe 𝐴𝑋𝐴))
74, 6sylbi 216 . . . . . . 7 (𝜃 → (𝑅 FrSe 𝐴𝑋𝐴))
87bnj705 34598 . . . . . 6 ((𝜃𝜒𝜏𝜂) → (𝑅 FrSe 𝐴𝑋𝐴))
9 bnj643 34594 . . . . . . 7 ((𝜃𝜒𝜏𝜂) → 𝜒)
10 bnj1006.5 . . . . . . . . 9 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛))
11 3simpc 1147 . . . . . . . . 9 ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛) → (𝑛 = suc 𝑚𝑝 = suc 𝑛))
1210, 11sylbi 216 . . . . . . . 8 (𝜏 → (𝑛 = suc 𝑚𝑝 = suc 𝑛))
1312bnj707 34600 . . . . . . 7 ((𝜃𝜒𝜏𝜂) → (𝑛 = suc 𝑚𝑝 = suc 𝑛))
14 3anass 1092 . . . . . . 7 ((𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ↔ (𝜒 ∧ (𝑛 = suc 𝑚𝑝 = suc 𝑛)))
159, 13, 14sylanbrc 581 . . . . . 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 260 . . . . . . 7 ((𝑓 Fn 𝑛𝜑𝜓) ↔ (𝑓 Fn 𝑛𝜑𝜓))
22 biid 260 . . . . . . 7 ((𝑛𝐷𝑝 = suc 𝑛𝑚𝑛) ↔ (𝑛𝐷𝑝 = suc 𝑛𝑚𝑛))
2316, 17, 18, 19, 20, 21, 22bnj969 34791 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐶 ∈ V)
248, 15, 23syl2anc 582 . . . . 5 ((𝜃𝜒𝜏𝜂) → 𝐶 ∈ V)
2518bnj1235 34649 . . . . . 6 (𝜒𝑓 Fn 𝑛)
2625bnj706 34599 . . . . 5 ((𝜃𝜒𝜏𝜂) → 𝑓 Fn 𝑛)
2710simp3bi 1144 . . . . . 6 (𝜏𝑝 = suc 𝑛)
2827bnj707 34600 . . . . 5 ((𝜃𝜒𝜏𝜂) → 𝑝 = suc 𝑛)
291simplbi 496 . . . . . 6 (𝜂𝑖𝑛)
3029bnj708 34601 . . . . 5 ((𝜃𝜒𝜏𝜂) → 𝑖𝑛)
3124, 26, 28, 30bnj951 34620 . . . 4 ((𝜃𝜒𝜏𝜂) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛𝑖𝑛))
32 bnj1006.16 . . . . 5 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
3332bnj945 34618 . . . 4 ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛𝑖𝑛) → (𝐺𝑖) = (𝑓𝑖))
3431, 33syl 17 . . 3 ((𝜃𝜒𝜏𝜂) → (𝐺𝑖) = (𝑓𝑖))
353, 34eleqtrrd 2829 . 2 ((𝜃𝜒𝜏𝜂) → 𝑦 ∈ (𝐺𝑖))
36 bnj1006.28 . . . . 5 ((𝜃𝜒𝜏𝜂) → (𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝))
3736anim1i 613 . . . 4 (((𝜃𝜒𝜏𝜂) ∧ 𝑦 ∈ (𝐺𝑖)) → ((𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝) ∧ 𝑦 ∈ (𝐺𝑖)))
38 df-bnj17 34532 . . . 4 ((𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝𝑦 ∈ (𝐺𝑖)) ↔ ((𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝) ∧ 𝑦 ∈ (𝐺𝑖)))
3937, 38sylibr 233 . . 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 34803 . . 3 ((𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝𝑦 ∈ (𝐺𝑖)) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
4739, 46syl 17 . 2 (((𝜃𝜒𝜏𝜂) ∧ 𝑦 ∈ (𝐺𝑖)) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
4835, 47mpdan 685 1 ((𝜃𝜒𝜏𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1534  wcel 2099  wral 3051  Vcvv 3462  [wsbc 3776  cdif 3944  cun 3945  wss 3947  c0 4325  {csn 4633  cop 4639   ciun 5001  suc csuc 6378   Fn wfn 6549  cfv 6554  ωcom 7876  w-bnj17 34531   predc-bnj14 34533   FrSe w-bnj15 34537   trClc-bnj18 34539
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5290  ax-sep 5304  ax-nul 5311  ax-pr 5433  ax-un 7746  ax-reg 9635
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3464  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3967  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-iun 5003  df-br 5154  df-opab 5216  df-tr 5271  df-id 5580  df-eprel 5586  df-po 5594  df-so 5595  df-fr 5637  df-we 5639  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-res 5694  df-ord 6379  df-on 6380  df-lim 6381  df-suc 6382  df-iota 6506  df-fun 6556  df-fn 6557  df-fv 6562  df-om 7877  df-bnj17 34532  df-bnj14 34534  df-bnj13 34536  df-bnj15 34538
This theorem is referenced by:  bnj1020  34810
  Copyright terms: Public domain W3C validator