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

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

Proof of Theorem bnj1020
StepHypRef Expression
1 bnj1019 34937 . . 3 (∃𝑝(𝜃𝜒𝜏𝜂) ↔ (𝜃𝜒𝜂 ∧ ∃𝑝𝜏))
2 bnj1020.1 . . . . 5 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
3 bnj1020.2 . . . . 5 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
4 bnj1020.3 . . . . 5 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
5 bnj1020.4 . . . . 5 (𝜃 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
6 bnj1020.5 . . . . 5 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛))
7 bnj1020.6 . . . . 5 (𝜂 ↔ (𝑖𝑛𝑦 ∈ (𝑓𝑖)))
8 bnj1020.7 . . . . 5 (𝜑′[𝑝 / 𝑛]𝜑)
9 bnj1020.8 . . . . 5 (𝜓′[𝑝 / 𝑛]𝜓)
10 bnj1020.9 . . . . 5 (𝜒′[𝑝 / 𝑛]𝜒)
11 bnj1020.10 . . . . 5 (𝜑″[𝐺 / 𝑓]𝜑′)
12 bnj1020.11 . . . . 5 (𝜓″[𝐺 / 𝑓]𝜓′)
13 bnj1020.12 . . . . 5 (𝜒″[𝐺 / 𝑓]𝜒′)
14 bnj1020.13 . . . . 5 𝐷 = (ω ∖ {∅})
15 bnj1020.15 . . . . 5 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
16 bnj1020.16 . . . . 5 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
17 bnj1020.14 . . . . . . 7 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
182, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 17, 15, 16bnj998 35115 . . . . . 6 ((𝜃𝜒𝜏𝜂) → 𝜒″)
194, 6, 7, 14, 18bnj1001 35117 . . . . 5 ((𝜃𝜒𝜏𝜂) → (𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝))
202, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 19bnj1006 35118 . . . 4 ((𝜃𝜒𝜏𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
2120exlimiv 1932 . . 3 (∃𝑝(𝜃𝜒𝜏𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
221, 21sylbir 235 . 2 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
23 bnj1020.26 . . 3 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
242, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 17, 15, 16, 23, 18, 19bnj1018 35122 . 2 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
2522, 24sstrd 3945 1 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wex 1781  wcel 2114  {cab 2715  wral 3052  wrex 3061  [wsbc 3741  cdif 3899  cun 3900  wss 3902  c0 4286  {csn 4581  cop 4587   ciun 4947  suc csuc 6320   Fn wfn 6488  cfv 6493  ωcom 7810  w-bnj17 34844   predc-bnj14 34846   FrSe w-bnj15 34850   trClc-bnj18 34852
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682  ax-reg 9501
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-sbc 3742  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-res 5637  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-fv 6501  df-om 7811  df-bnj17 34845  df-bnj14 34847  df-bnj13 34849  df-bnj15 34851  df-bnj18 34853
This theorem is referenced by:  bnj907  35125
  Copyright terms: Public domain W3C validator