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 31033
Description: Technical lemma for bnj69 31078. 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 30850 . . 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 31026 . . . . . 6 ((𝜃𝜒𝜏𝜂) → 𝜒″)
194, 6, 7, 14, 18bnj1001 31028 . . . . 5 ((𝜃𝜒𝜏𝜂) → (𝜒″𝑖 ∈ ω ∧ suc 𝑖𝑝))
202, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 19bnj1006 31029 . . . 4 ((𝜃𝜒𝜏𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
2120exlimiv 1858 . . 3 (∃𝑝(𝜃𝜒𝜏𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
221, 21sylbir 225 . 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 31032 . 2 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → (𝐺‘suc 𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
2522, 24sstrd 3613 1 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wex 1704  wcel 1990  {cab 2608  wral 2912  wrex 2913  [wsbc 3435  cdif 3571  cun 3572  wss 3574  c0 3915  {csn 4177  cop 4183   ciun 4520  suc csuc 5725   Fn wfn 5883  cfv 5888  ωcom 7065  w-bnj17 30752   predc-bnj14 30754   FrSe w-bnj15 30758   trClc-bnj18 30760
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949  ax-reg 8497
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-bnj17 30753  df-bnj14 30755  df-bnj13 30757  df-bnj15 30759  df-bnj18 30761
This theorem is referenced by:  bnj907  31035
  Copyright terms: Public domain W3C validator