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

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

Proof of Theorem bnj1466
StepHypRef Expression
1 bnj1466.12 . . 3 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
2 bnj1466.10 . . . . 5 𝑃 = ∪ 𝐻
3 bnj1466.9 . . . . . . . 8 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
43bnj1317 35563 . . . . . . 7 (𝑤 ∈ 𝐻 → ∀𝑓 𝑤 ∈ 𝐻)
54nfcii 2918 . . . . . 6 Ⅎ𝑓𝐻
65nfuni 4878 . . . . 5 Ⅎ𝑓∪ 𝐻
72, 6nfcxfr 2927 . . . 4 Ⅎ𝑓𝑃
8 nfcv 2929 . . . . . 6 Ⅎ𝑓𝑥
9 nfcv 2929 . . . . . . 7 Ⅎ𝑓𝐺
10 bnj1466.11 . . . . . . . 8 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
11 nfcv 2929 . . . . . . . . . 10 Ⅎ𝑓 pred(𝑥, 𝐴, 𝑅)
127, 11nfres 5987 . . . . . . . . 9 Ⅎ𝑓(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
138, 12nfop 4853 . . . . . . . 8 Ⅎ𝑓⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
1410, 13nfcxfr 2927 . . . . . . 7 Ⅎ𝑓𝑍
159, 14nffv 6925 . . . . . 6 Ⅎ𝑓(𝐺‘𝑍)
168, 15nfop 4853 . . . . 5 Ⅎ𝑓⟨𝑥, (𝐺‘𝑍)⟩
1716nfsn 4668 . . . 4 Ⅎ𝑓{⟨𝑥, (𝐺‘𝑍)⟩}
187, 17nfun 4171 . . 3 Ⅎ𝑓(𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
191, 18nfcxfr 2927 . 2 Ⅎ𝑓𝑄
2019nfcrii 2924 1 (𝑤 ∈ 𝑄 → ∀𝑓 𝑤 ∈ 𝑄)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104  ∀wal 1570   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744   ≠ wne 2962  ∀wral 3083  ∃wrex 3093  {crab 3415  [wsbc 3741   ⊆ wss 3899   ∪ cun 4151  ∅c0 4280  {csn 4587  ⟨cop 4839  ∪ cuni 4871   class class class wbr 5107  dom cdm 5657   ↾ cres 5659   Fn wfn 6560  ‘cfv 6565   predc-bnj14 35431   FrSe w-bnj15 35435   trClc-bnj18 35437
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-xp 5663  df-res 5669  df-iota 6519  df-fv 6573
This theorem is used by:  bnj1463  35797  bnj1491  35799
  Copyright terms: Public domain W3C validator