Theorem bnj1374 35661

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

Assertion

Ref	Expression
bnj1374	⊢ (𝑓 ∈ 𝐻 → 𝑓 ∈ 𝐶)

Distinct variable groups:   𝑥,𝐴   𝐵,𝑓   𝑦,𝐶   𝑥,𝑅   𝑓,𝑑,𝑥   𝑦,𝑓,𝑥

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

Proof of Theorem bnj1374

Step	Hyp	Ref	Expression
1		bnj1374.9	. . . . . 6 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
2	1	bnj1436 35469	. . . . 5 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′)
3		rexex 3092	. . . . 5 ⊢ (∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′ → ∃𝑦𝜏′)
4	2, 3	syl 18	. . . 4 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦𝜏′)
5		bnj1374.1	. . . . . 6 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
6		bnj1374.2	. . . . . 6 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
7		bnj1374.3	. . . . . 6 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
8		bnj1374.4	. . . . . 6 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
9		bnj1374.8	. . . . . 6 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
10	5, 6, 7, 8, 9	bnj1373 35660	. . . . 5 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
11	10	exbii 1880	. . . 4 ⊢ (∃𝑦𝜏′ ↔ ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
12	4, 11	sylib 221	. . 3 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
13		exsimpl 1900	. . 3 ⊢ (∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∃𝑦 𝑓 ∈ 𝐶)
14	12, 13	syl 18	. 2 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 𝑓 ∈ 𝐶)
15	14	bnj937 35402	1 ⊢ (𝑓 ∈ 𝐻 → 𝑓 ∈ 𝐶)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412  [wsbc 3738   ⊆ wss 3895   ∪ cun 4149  ∅c0 4278  {csn 4583  ⟨cop 4589   class class class wbr 5102  dom cdm 5650   ↾ cres 5652   Fn wfn 6533  ‘cfv 6538   predc-bnj14 35319   FrSe w-bnj15 35323   trClc-bnj18 35325

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-iun 4952  df-br 5103  df-bnj14 35320  df-bnj18 35326

This theorem is used by:  bnj1384  35662