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

Theorem bnj908 35561
Description: Technical lemma for bnj69 35640. 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
bnj908.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj908.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj908.3 𝐷 = (ω ∖ {∅})
bnj908.4 (𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
bnj908.5 (𝜃 ↔ ∀𝑚 ∈ 𝐷 (𝑚 E 𝑛 → [𝑚 / 𝑛]𝜒))
bnj908.10 (𝜑′ ↔ [𝑚 / 𝑛]𝜑)
bnj908.11 (𝜓′ ↔ [𝑚 / 𝑛]𝜓)
bnj908.12 (𝜒′ ↔ [𝑚 / 𝑛]𝜒)
bnj908.13 (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
bnj908.14 (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
bnj908.15 (𝜒″ ↔ [𝐺 / 𝑓]𝜒)
bnj908.16 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj908.17 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj908.18 (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
bnj908.19 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj908.20 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
bnj908.21 (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
bnj908.22 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj908.23 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj908.24 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj908.25 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj908.26 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
Assertion
Ref Expression
bnj908 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → ∃𝑓(𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″))
Distinct variable groups:   𝐴,𝑓,𝑖,𝑚,𝑛,𝑝   𝑦,𝐴,𝑓,𝑖,𝑛,𝑝   𝐷,𝑝   𝑖,𝐺,𝑦   𝑅,𝑓,𝑖,𝑚,𝑛,𝑝   𝑦,𝑅   𝜂,𝑓,𝑖   𝑥,𝑓,𝑚,𝑛,𝑝   𝑖,𝜑′,𝑝   𝜑,𝑚,𝑝   𝜓,𝑚,𝑝   𝜃,𝑝
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜓(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜒(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜃(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝜏(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜂(𝑥, 𝑦, 𝑚, 𝑛, 𝑝)   𝜁(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜎(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜌(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑥)   𝐵(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐶(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐷(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝑅(𝑥)   𝐺(𝑥, 𝑓, 𝑚, 𝑛, 𝑝)   𝐾(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐿(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑′(𝑥, 𝑦, 𝑓, 𝑚, 𝑛)   𝜓′(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒′(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑″(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓″(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒″(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj908
StepHypRef Expression
1 bnj248 35331 . . . . . 6 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) ↔ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝜒′) ∧ 𝜂))
2 bnj908.4 . . . . . . . . . . 11 (𝜒 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
3 bnj908.10 . . . . . . . . . . 11 (𝜑′ ↔ [𝑚 / 𝑛]𝜑)
4 bnj908.11 . . . . . . . . . . 11 (𝜓′ ↔ [𝑚 / 𝑛]𝜓)
5 bnj908.12 . . . . . . . . . . 11 (𝜒′ ↔ [𝑚 / 𝑛]𝜒)
6 vex 3455 . . . . . . . . . . 11 𝑚 ∈ V
72, 3, 4, 5, 6bnj207 35511 . . . . . . . . . 10 (𝜒′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
87biimpi 219 . . . . . . . . 9 (𝜒′ → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
9 euex 2603 . . . . . . . . 9 (∃!𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′) → ∃𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
108, 9syl6 36 . . . . . . . 8 (𝜒′ → ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
1110impcom 413 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝜒′) → ∃𝑓(𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
12 bnj908.17 . . . . . . 7 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
1311, 12bnj1198 35425 . . . . . 6 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝜒′) → ∃𝑓𝜏)
141, 13bnj832 35389 . . . . 5 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → ∃𝑓𝜏)
15 bnj645 35381 . . . . 5 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → 𝜂)
16 19.41v 1982 . . . . 5 (∃𝑓(𝜏 ∧ 𝜂) ↔ (∃𝑓𝜏 ∧ 𝜂))
1714, 15, 16sylanbrc 595 . . . 4 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → ∃𝑓(𝜏 ∧ 𝜂))
18 bnj642 35379 . . . 4 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → 𝑅 FrSe 𝐴)
19 19.41v 1982 . . . 4 (∃𝑓((𝜏 ∧ 𝜂) ∧ 𝑅 FrSe 𝐴) ↔ (∃𝑓(𝜏 ∧ 𝜂) ∧ 𝑅 FrSe 𝐴))
2017, 18, 19sylanbrc 595 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → ∃𝑓((𝜏 ∧ 𝜂) ∧ 𝑅 FrSe 𝐴))
21 bnj170 35329 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) ↔ ((𝜏 ∧ 𝜂) ∧ 𝑅 FrSe 𝐴))
2220, 21bnj1198 35425 . 2 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → ∃𝑓(𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂))
23 bnj908.18 . . . 4 (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
24 bnj908.19 . . . 4 (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
25 bnj908.1 . . . . . 6 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2625, 3, 6bnj523 35517 . . . . 5 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
27 bnj908.2 . . . . . 6 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
2827, 4, 6bnj539 35521 . . . . 5 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
29 bnj908.3 . . . . 5 𝐷 = (ω ∖ {∅})
30 bnj908.16 . . . . 5 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
3126, 28, 29, 30, 12, 23bnj544 35524 . . . 4 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)
3223, 24, 31bnj561 35533 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝐺 Fn 𝑛)
33 bnj908.13 . . . . . 6 (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
3430bnj528 35519 . . . . . 6 𝐺 ∈ V
3525, 33, 34bnj609 35547 . . . . 5 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3626, 29, 30, 12, 23, 31, 35bnj545 35525 . . . 4 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝜑″)
3723, 24, 36bnj562 35534 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜑″)
38 bnj908.20 . . . 4 (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖))
39 bnj908.22 . . . 4 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
40 bnj908.23 . . . 4 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
41 bnj908.24 . . . 4 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
42 bnj908.25 . . . 4 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
43 bnj908.26 . . . 4 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
44 bnj908.21 . . . 4 (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
45 bnj908.14 . . . . 5 (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
4627, 45, 34bnj611 35548 . . . 4 (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
4729, 30, 12, 23, 24, 38, 39, 40, 41, 42, 43, 26, 28, 31, 44, 32, 46bnj571 35536 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝜓″)
4832, 37, 473jca 1146 . 2 ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → (𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″))
4922, 48bnj593 35376 1 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝜒′ ∧ 𝜂) → ∃𝑓(𝐺 Fn 𝑛 ∧ 𝜑″ ∧ 𝜓″))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2594   ≠ wne 2956  ∀wral 3077  [wsbc 3739   ∖ cdif 3896   ∪ cun 3897  ∅c0 4279  {csn 4584  ⟨cop 4590  ∪ ciun 4951   class class class wbr 5103   E cep 5550  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   ∧ w-bnj17 35317   predc-bnj14 35319   FrSe w-bnj15 35323
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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751  ax-reg 9586
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-om 7878  df-bnj17 35318  df-bnj14 35320  df-bnj13 35322  df-bnj15 35324
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator