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

Theorem bnj1256 32995
Description: Technical lemma for bnj60 33042. 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
bnj1256.1 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1256.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1256.3 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
bnj1256.4 𝐷 = (dom 𝑔 ∩ dom )
bnj1256.5 𝐸 = {𝑥𝐷 ∣ (𝑔𝑥) ≠ (𝑥)}
bnj1256.6 (𝜑 ↔ (𝑅 FrSe 𝐴𝑔𝐶𝐶 ∧ (𝑔𝐷) ≠ (𝐷)))
bnj1256.7 (𝜓 ↔ (𝜑𝑥𝐸 ∧ ∀𝑦𝐸 ¬ 𝑦𝑅𝑥))
Assertion
Ref Expression
bnj1256 (𝜑 → ∃𝑑𝐵 𝑔 Fn 𝑑)
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓,𝑔   𝑓,𝐺,𝑔   𝑅,𝑓   𝑔,𝑌   𝑓,𝑑,𝑔   𝑥,𝑓,𝑔
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑓,𝑔,,𝑑)   𝜓(𝑥,𝑦,𝑓,𝑔,,𝑑)   𝐴(𝑥,𝑦,𝑔,,𝑑)   𝐵(𝑥,𝑦,,𝑑)   𝐶(𝑥,𝑦,𝑓,𝑔,,𝑑)   𝐷(𝑥,𝑦,𝑓,𝑔,,𝑑)   𝑅(𝑥,𝑦,𝑔,,𝑑)   𝐸(𝑥,𝑦,𝑓,𝑔,,𝑑)   𝐺(𝑥,𝑦,,𝑑)   𝑌(𝑥,𝑦,𝑓,,𝑑)

Proof of Theorem bnj1256
StepHypRef Expression
1 bnj1256.6 . 2 (𝜑 ↔ (𝑅 FrSe 𝐴𝑔𝐶𝐶 ∧ (𝑔𝐷) ≠ (𝐷)))
2 abid 2719 . . . 4 (𝑔 ∈ {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))} ↔ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩)))
32bnj1238 32786 . . 3 (𝑔 ∈ {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))} → ∃𝑑𝐵 𝑔 Fn 𝑑)
4 bnj1256.2 . . . 4 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
5 bnj1256.3 . . . 4 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
6 eqid 2738 . . . 4 𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
7 eqid 2738 . . . 4 {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))} = {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))}
84, 5, 6, 7bnj1234 32993 . . 3 𝐶 = {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))}
93, 8eleq2s 2857 . 2 (𝑔𝐶 → ∃𝑑𝐵 𝑔 Fn 𝑑)
101, 9bnj770 32743 1 (𝜑 → ∃𝑑𝐵 𝑔 Fn 𝑑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1086   = wceq 1539  wcel 2106  {cab 2715  wne 2943  wral 3064  wrex 3065  {crab 3068  cin 3886  wss 3887  cop 4567   class class class wbr 5074  dom cdm 5589  cres 5591   Fn wfn 6428  cfv 6433  w-bnj17 32665   predc-bnj14 32667   FrSe w-bnj15 32671
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-12 2171  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-res 5601  df-iota 6391  df-fun 6435  df-fn 6436  df-fv 6441  df-bnj17 32666
This theorem is referenced by:  bnj1253  32997  bnj1286  32999  bnj1280  33000
  Copyright terms: Public domain W3C validator