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

Theorem bnj1467 35618
Description: Technical lemma for bnj60 35626. 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
bnj1467.1 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1467.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1467.3 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1467.4 (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
bnj1467.5 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
bnj1467.6 (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
bnj1467.7 (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
bnj1467.8 (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
bnj1467.9 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
bnj1467.10 𝑃 = ∪ 𝐻
bnj1467.11 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1467.12 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
Assertion
Ref Expression
bnj1467 (𝑤 ∈ 𝑄 → ∀𝑑 𝑤 ∈ 𝑄)
Distinct variable groups:   𝐴,𝑑,𝑤,𝑥   𝐵,𝑓   𝑤,𝐶   𝐺,𝑑,𝑤   𝑤,𝐻   𝑤,𝑃   𝑅,𝑑,𝑤,𝑥   𝑤,𝑍   𝑓,𝑑,𝑤,𝑥   𝑦,𝑑,𝑥
Allowed substitution hints:   𝜓(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)   𝜒(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)   𝜏(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)   𝐴(𝑦, 𝑓)   𝐵(𝑥, 𝑦, 𝑤, 𝑑)   𝐶(𝑥, 𝑦, 𝑓, 𝑑)   𝐷(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)   𝑃(𝑥, 𝑦, 𝑓, 𝑑)   𝑄(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)   𝑅(𝑦, 𝑓)   𝐺(𝑥, 𝑦, 𝑓)   𝐻(𝑥, 𝑦, 𝑓, 𝑑)   𝑌(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)   𝑍(𝑥, 𝑦, 𝑓, 𝑑)   𝜏′(𝑥, 𝑦, 𝑤, 𝑓, 𝑑)

Proof of Theorem bnj1467
StepHypRef Expression
1 bnj1467.12 . . 3 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
2 bnj1467.10 . . . . 5 𝑃 = ∪ 𝐻
3 bnj1467.9 . . . . . . 7 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
4 nfcv 2922 . . . . . . . . 9 Ⅎ𝑑 pred(𝑥, 𝐴, 𝑅)
5 bnj1467.8 . . . . . . . . . 10 (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
6 nfcv 2922 . . . . . . . . . . 11 Ⅎ𝑑𝑦
7 bnj1467.4 . . . . . . . . . . . 12 (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
8 bnj1467.3 . . . . . . . . . . . . . . 15 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
9 nfre1 3287 . . . . . . . . . . . . . . . 16 Ⅎ𝑑∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))
109nfab 2928 . . . . . . . . . . . . . . 15 Ⅎ𝑑{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
118, 10nfcxfr 2920 . . . . . . . . . . . . . 14 Ⅎ𝑑𝐶
1211nfcri 2914 . . . . . . . . . . . . 13 Ⅎ𝑑 𝑓 ∈ 𝐶
13 nfv 1947 . . . . . . . . . . . . 13 Ⅎ𝑑dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
1412, 13nfan 1932 . . . . . . . . . . . 12 Ⅎ𝑑(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
157, 14nfxfr 1886 . . . . . . . . . . 11 Ⅎ𝑑𝜏
166, 15nfsbcw 3760 . . . . . . . . . 10 Ⅎ𝑑[𝑦 / 𝑥]𝜏
175, 16nfxfr 1886 . . . . . . . . 9 Ⅎ𝑑𝜏′
184, 17nfrexw 3310 . . . . . . . 8 Ⅎ𝑑∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′
1918nfab 2928 . . . . . . 7 Ⅎ𝑑{𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
203, 19nfcxfr 2920 . . . . . 6 Ⅎ𝑑𝐻
2120nfuni 4873 . . . . 5 Ⅎ𝑑∪ 𝐻
222, 21nfcxfr 2920 . . . 4 Ⅎ𝑑𝑃
23 nfcv 2922 . . . . . 6 Ⅎ𝑑𝑥
24 nfcv 2922 . . . . . . 7 Ⅎ𝑑𝐺
25 bnj1467.11 . . . . . . . 8 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
2622, 4nfres 5968 . . . . . . . . 9 Ⅎ𝑑(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
2723, 26nfop 4848 . . . . . . . 8 Ⅎ𝑑⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
2825, 27nfcxfr 2920 . . . . . . 7 Ⅎ𝑑𝑍
2924, 28nffv 6883 . . . . . 6 Ⅎ𝑑(𝐺‘𝑍)
3023, 29nfop 4848 . . . . 5 Ⅎ𝑑⟨𝑥, (𝐺‘𝑍)⟩
3130nfsn 4667 . . . 4 Ⅎ𝑑{⟨𝑥, (𝐺‘𝑍)⟩}
3222, 31nfun 4116 . . 3 Ⅎ𝑑(𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
331, 32nfcxfr 2920 . 2 Ⅎ𝑑𝑄
3433nfcrii 2917 1 (𝑤 ∈ 𝑄 → ∀𝑑 𝑤 ∈ 𝑄)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412  [wsbc 3738   ∪ cun 3896   ⊆ wss 3898  ∅c0 4278  {csn 4583  ⟨cop 4589  ∪ cuni 4866   class class class wbr 5102  dom cdm 5647   ↾ cres 5649   Fn wfn 6522  ‘cfv 6527   predc-bnj14 35253   FrSe w-bnj15 35257   trClc-bnj18 35259
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 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5653  df-res 5659  df-iota 6483  df-fv 6535
This theorem is used by:  bnj1463  35619
  Copyright terms: Public domain W3C validator