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 31551
Description: Technical lemma for bnj69 31594. 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 31550 . . . . . . . 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 3389 . . . . . . . . . . . . . 14 𝑝 ∈ V
194, 10, 11, 12, 18bnj919 31353 . . . . . . . . . . . . 13 (𝜒′ ↔ (𝑝𝐷𝑓 Fn 𝑝𝜑′𝜓′))
2017bnj918 31352 . . . . . . . . . . . . 13 𝐺 ∈ V
2119, 13, 14, 15, 20bnj976 31364 . . . . . . . . . . . 12 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
222, 3, 4, 1, 5, 6, 10, 11, 12, 13, 14, 15, 7, 8, 16, 17, 21bnj1020 31549 . . . . . . . . . . 11 ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
2322ax-gen 1891 . . . . . . . . . 10 𝑚((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
24 19.29r 1974 . . . . . . . . . . 11 ((∃𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ∀𝑚((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))) → ∃𝑚((𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))))
25 pm3.33 782 . . . . . . . . . . 11 (((𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))) → (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
2624, 25bnj593 31331 . . . . . . . . . 10 ((∃𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) ∧ ∀𝑚((𝜃𝜒𝜂 ∧ ∃𝑝𝜏) → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))) → ∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
2723, 26mpan2 683 . . . . . . . . 9 (∃𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) → ∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
28272eximi 1931 . . . . . . . 8 (∃𝑛𝑖𝑚(𝜃 → (𝜃𝜒𝜂 ∧ ∃𝑝𝜏)) → ∃𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
299, 28bnj101 31308 . . . . . . 7 𝑓𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
30 19.9v 2080 . . . . . . 7 (∃𝑓𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ∃𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3129, 30mpbi 222 . . . . . 6 𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
32 19.9v 2080 . . . . . 6 (∃𝑛𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ∃𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3331, 32mpbi 222 . . . . 5 𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
34 19.9v 2080 . . . . 5 (∃𝑖𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3533, 34mpbi 222 . . . 4 𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
36 19.9v 2080 . . . 4 (∃𝑚(𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3735, 36mpbi 222 . . 3 (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
381bnj1254 31396 . . 3 (𝜃𝑧 ∈ pred(𝑦, 𝐴, 𝑅))
3937, 38sseldd 3800 . 2 (𝜃𝑧 ∈ trCl(𝑋, 𝐴, 𝑅))
401, 39bnj978 31535 1 ((𝑅 FrSe 𝐴𝑋𝐴) → TrFo( trCl(𝑋, 𝐴, 𝑅), 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 385  w3a 1108  wal 1651   = wceq 1653  wex 1875  wcel 2157  {cab 2786  wral 3090  wrex 3091  [wsbc 3634  cdif 3767  cun 3768  wss 3770  c0 4116  {csn 4369  cop 4375   ciun 4711  suc csuc 5944   Fn wfn 6097  cfv 6102  ωcom 7300  w-bnj17 31271   predc-bnj14 31273   FrSe w-bnj15 31277   trClc-bnj18 31279   TrFow-bnj19 31281
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2378  ax-ext 2778  ax-rep 4965  ax-sep 4976  ax-nul 4984  ax-pr 5098  ax-un 7184  ax-reg 8740
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2592  df-eu 2610  df-clab 2787  df-cleq 2793  df-clel 2796  df-nfc 2931  df-ne 2973  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3388  df-sbc 3635  df-csb 3730  df-dif 3773  df-un 3775  df-in 3777  df-ss 3784  df-pss 3786  df-nul 4117  df-if 4279  df-pw 4352  df-sn 4370  df-pr 4372  df-tp 4374  df-op 4376  df-uni 4630  df-iun 4713  df-br 4845  df-opab 4907  df-mpt 4924  df-tr 4947  df-id 5221  df-eprel 5226  df-po 5234  df-so 5235  df-fr 5272  df-we 5274  df-xp 5319  df-rel 5320  df-cnv 5321  df-co 5322  df-dm 5323  df-rn 5324  df-res 5325  df-ima 5326  df-ord 5945  df-on 5946  df-lim 5947  df-suc 5948  df-iota 6065  df-fun 6104  df-fn 6105  df-f 6106  df-f1 6107  df-fo 6108  df-f1o 6109  df-fv 6110  df-om 7301  df-bnj17 31272  df-bnj14 31274  df-bnj13 31276  df-bnj15 31278  df-bnj18 31280  df-bnj19 31282
This theorem is referenced by:  bnj1029  31552
  Copyright terms: Public domain W3C validator