Theorem bnj1371 34028

Description: Technical lemma for bnj60 34061. 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
bnj1371.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1371.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1371.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1371.4	⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
bnj1371.5	⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
bnj1371.6	⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
bnj1371.7	⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
bnj1371.8	⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
bnj1371.9	⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
bnj1371.10	⊢ 𝑃 = ∪ 𝐻
bnj1371.11	⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))

Assertion

Ref	Expression
bnj1371	⊢ (𝑓 ∈ 𝐻 → Fun 𝑓)

Distinct variable groups:   𝑓,𝑑   𝑦,𝑓

Allowed substitution hints:   𝜓(𝑥,𝑦,𝑓,𝑑)   𝜒(𝑥,𝑦,𝑓,𝑑)   𝜏(𝑥,𝑦,𝑓,𝑑)   𝐴(𝑥,𝑦,𝑓,𝑑)   𝐵(𝑥,𝑦,𝑓,𝑑)   𝐶(𝑥,𝑦,𝑓,𝑑)   𝐷(𝑥,𝑦,𝑓,𝑑)   𝑃(𝑥,𝑦,𝑓,𝑑)   𝑅(𝑥,𝑦,𝑓,𝑑)   𝐺(𝑥,𝑦,𝑓,𝑑)   𝐻(𝑥,𝑦,𝑓,𝑑)   𝑌(𝑥,𝑦,𝑓,𝑑)   𝜏′(𝑥,𝑦,𝑓,𝑑)

Proof of Theorem bnj1371

Step	Hyp	Ref	Expression
1		bnj1371.9	. . . . . . 7 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
2	1	bnj1436 33838	. . . . . 6 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′)
3		rexex 3076	. . . . . 6 ⊢ (∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′ → ∃𝑦𝜏′)
4	2, 3	syl 17	. . . . 5 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦𝜏′)
5		bnj1371.11	. . . . . 6 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
6	5	exbii 1850	. . . . 5 ⊢ (∃𝑦𝜏′ ↔ ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
7	4, 6	sylib 217	. . . 4 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
8		exsimpl 1871	. . . 4 ⊢ (∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∃𝑦 𝑓 ∈ 𝐶)
9	7, 8	syl 17	. . 3 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 𝑓 ∈ 𝐶)
10		bnj1371.3	. . . . . . 7 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
11	10	eqabri 2877	. . . . . 6 ⊢ (𝑓 ∈ 𝐶 ↔ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)))
12	11	bnj1238 33805	. . . . 5 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 𝑓 Fn 𝑑)
13		fnfun 6646	. . . . 5 ⊢ (𝑓 Fn 𝑑 → Fun 𝑓)
14	12, 13	bnj31 33718	. . . 4 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 Fun 𝑓)
15	14	bnj1265 33811	. . 3 ⊢ (𝑓 ∈ 𝐶 → Fun 𝑓)
16	9, 15	bnj593 33744	. 2 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦Fun 𝑓)
17	16	bnj937 33770	1 ⊢ (𝑓 ∈ 𝐻 → Fun 𝑓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541  ∃wex 1781   ∈ wcel 2106  {cab 2709   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  {crab 3432  [wsbc 3776   ∪ cun 3945   ⊆ wss 3947  ∅c0 4321  {csn 4627  ⟨cop 4633  ∪ cuni 4907   class class class wbr 5147  dom cdm 5675   ↾ cres 5677  Fun wfun 6534   Fn wfn 6535  ‘cfv 6540   predc-bnj14 33687   FrSe w-bnj15 33691   trClc-bnj18 33693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-12 2171  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-rex 3071  df-fn 6543

This theorem is referenced by:  bnj1384  34031