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

Theorem bnj1514 35460
Description: Technical lemma for bnj1500 35465. 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
bnj1514.1 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1514.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1514.3 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
Assertion
Ref Expression
bnj1514 (𝑓𝐶 → ∀𝑥 ∈ dom 𝑓(𝑓𝑥) = (𝐺𝑌))
Distinct variable groups:   𝑥,𝐴   𝐺,𝑑   𝑌,𝑑   𝑓,𝑑,𝑥
Allowed substitution hints:   𝐴(𝑓, 𝑑)   𝐵(𝑥, 𝑓, 𝑑)   𝐶(𝑥, 𝑓, 𝑑)   𝑅(𝑥, 𝑓, 𝑑)   𝐺(𝑥, 𝑓)   𝑌(𝑥, 𝑓)

Proof of Theorem bnj1514
StepHypRef Expression
1 bnj1514.3 . . . . 5 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
21bnj1436 35236 . . . 4 (𝑓𝐶 → ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)))
3 df-rex 3089 . . . . 5 (∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) ↔ ∃𝑑(𝑑𝐵 ∧ (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))))
4 3anass 1110 . . . . 5 ((𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) ↔ (𝑑𝐵 ∧ (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))))
53, 4bnj133 35125 . . . 4 (∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) ↔ ∃𝑑(𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)))
62, 5sylib 221 . . 3 (𝑓𝐶 → ∃𝑑(𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)))
7 simp3 1155 . . . 4 ((𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) → ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))
8 fndm 6638 . . . . 5 (𝑓 Fn 𝑑 → dom 𝑓 = 𝑑)
983ad2ant2 1151 . . . 4 ((𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) → dom 𝑓 = 𝑑)
107, 9raleqtrrdv 3326 . . 3 ((𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) → ∀𝑥 ∈ dom 𝑓(𝑓𝑥) = (𝐺𝑌))
116, 10bnj593 35143 . 2 (𝑓𝐶 → ∃𝑑𝑥 ∈ dom 𝑓(𝑓𝑥) = (𝐺𝑌))
1211bnj937 35169 1 (𝑓𝐶 → ∀𝑥 ∈ dom 𝑓(𝑓𝑥) = (𝐺𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400  w3a 1102   = wceq 1569  wex 1808  wcel 2142  {cab 2740  wral 3078  wrex 3088  wss 3904  cop 4594  dom cdm 5660  cres 5662   Fn wfn 6531  cfv 6536   predc-bnj14 35086
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-12 2212  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-3an 1104  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-fn 6539
This theorem is used by:  bnj1501  35464
  Copyright terms: Public domain W3C validator