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 31209
 Description: Technical lemma for bnj60 31256. 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 2639 . . . 4 (𝑔 ∈ {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))} ↔ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩)))
32bnj1238 31003 . . 3 (𝑔 ∈ {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))} → ∃𝑑𝐵 𝑔 Fn 𝑑)
4 bnj1256.2 . . . 4 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
5 bnj1256.3 . . . 4 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
6 eqid 2651 . . . 4 𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩
7 eqid 2651 . . . 4 {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))} = {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))}
84, 5, 6, 7bnj1234 31207 . . 3 𝐶 = {𝑔 ∣ ∃𝑑𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑔𝑥) = (𝐺‘⟨𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))⟩))}
93, 8eleq2s 2748 . 2 (𝑔𝐶 → ∃𝑑𝐵 𝑔 Fn 𝑑)
101, 9bnj770 30959 1 (𝜑 → ∃𝑑𝐵 𝑔 Fn 𝑑)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030  {cab 2637   ≠ wne 2823  ∀wral 2941  ∃wrex 2942  {crab 2945   ∩ cin 3606   ⊆ wss 3607  ⟨cop 4216   class class class wbr 4685  dom cdm 5143   ↾ cres 5145   Fn wfn 5921  ‘cfv 5926   ∧ w-bnj17 30880   predc-bnj14 30882   FrSe w-bnj15 30886 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-res 5155  df-iota 5889  df-fun 5928  df-fn 5929  df-fv 5934  df-bnj17 30881 This theorem is referenced by:  bnj1253  31211  bnj1286  31213  bnj1280  31214
 Copyright terms: Public domain W3C validator