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

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

Proof of Theorem bnj907
StepHypRef Expression
1 bnj907.4 . 2 (𝜃 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
2 bnj907.1 . . . . . . . . 9 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
3 bnj907.2 . . . . . . . . 9 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
4 bnj907.3 . . . . . . . . 9 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
5 bnj907.5 . . . . . . . . 9 (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝 = suc 𝑛))
6 bnj907.6 . . . . . . . . 9 (𝜂 ↔ (𝑖𝑛𝑦 ∈ (𝑓𝑖)))
7 bnj907.13 . . . . . . . . 9 𝐷 = (ω ∖ {∅})
8 bnj907.14 . . . . . . . . 9 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
92, 3, 4, 1, 5, 6, 7, 8bnj1021 35462 . . . . . . . 8 𝑓𝑛𝑖𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏))
10 bnj907.7 . . . . . . . . . . . 12 (𝜑′[𝑝 / 𝑛]𝜑)
11 bnj907.8 . . . . . . . . . . . 12 (𝜓′[𝑝 / 𝑛]𝜓)
12 bnj907.9 . . . . . . . . . . . 12 (𝜒′[𝑝 / 𝑛]𝜒)
13 bnj907.10 . . . . . . . . . . . 12 (𝜑″[𝐺 / 𝑓]𝜑′)
14 bnj907.11 . . . . . . . . . . . 12 (𝜓″[𝐺 / 𝑓]𝜓′)
15 bnj907.12 . . . . . . . . . . . 12 (𝜒″[𝐺 / 𝑓]𝜒′)
16 bnj907.15 . . . . . . . . . . . 12 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
17 bnj907.16 . . . . . . . . . . . 12 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
18 vex 3457 . . . . . . . . . . . . . 14 𝑝 ∈ V
194, 10, 11, 12, 18bnj919 35264 . . . . . . . . . . . . 13 (𝜒′ ↔ (𝑝𝐷𝑓 Fn 𝑝𝜑′𝜓′))
2017bnj918 35263 . . . . . . . . . . . . 13 𝐺 ∈ V
2119, 13, 14, 15, 20bnj976 35274 . . . . . . . . . . . 12 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
222, 3, 4, 1, 5, 6, 10, 11, 12, 13, 14, 15, 7, 8, 16, 17, 21bnj1020 35461 . . . . . . . . . . 11 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
2322ax-gen 1828 . . . . . . . . . 10 𝑚((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
24 19.29r 1907 . . . . . . . . . . 11 ((∃𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ∀𝑚((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))) → ∃𝑚((𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))))
25 pm3.33 777 . . . . . . . . . . 11 (((𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))) → (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
2624, 25bnj593 35242 . . . . . . . . . 10 ((∃𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ∀𝑚((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))) → ∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
2723, 26mpan2 704 . . . . . . . . 9 (∃𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) → ∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
28272eximi 1869 . . . . . . . 8 (∃𝑛𝑖𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) → ∃𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
299, 28bnj101 35220 . . . . . . 7 𝑓𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
30 19.9v 2017 . . . . . . 7 (∃𝑓𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ∃𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3129, 30mpbi 233 . . . . . 6 𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
32 19.9v 2017 . . . . . 6 (∃𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ∃𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3331, 32mpbi 233 . . . . 5 𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
34 19.9v 2017 . . . . 5 (∃𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3533, 34mpbi 233 . . . 4 𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
36 19.9v 2017 . . . 4 (∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3735, 36mpbi 233 . . 3 (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
381bnj1254 35305 . . 3 (𝜃𝑧 ∈ pred(𝑦, 𝐴, 𝑅))
3937, 38sseldd 3935 . 2 (𝜃𝑧 ∈ trCl(𝑋, 𝐴, 𝑅))
401, 39bnj978 35445 1 ((𝑅 FrSe 𝐴𝑋𝐴) → TrFo( trCl(𝑋, 𝐴, 𝑅), 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103  wal 1568   = wceq 1570  wex 1812  wcel 2145  {cab 2740  wral 3078  wrex 3088  [wsbc 3742  cdif 3899  cun 3900  wss 3902  c0 4282  {csn 4587  cop 4593   ciun 4954  suc csuc 6363   Fn wfn 6532  cfv 6537  ωcom 7865  w-bnj17 35183   predc-bnj14 35185   FrSe w-bnj15 35189   trClc-bnj18 35191   TrFow-bnj19 35193
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739  ax-reg 9567
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-res 5671  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-om 7866  df-bnj17 35184  df-bnj14 35186  df-bnj13 35188  df-bnj15 35190  df-bnj18 35192  df-bnj19 35194
This theorem is used by:  bnj1029  35464
  Copyright terms: Public domain W3C validator