Theorem bnj1446 35442

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

Assertion

Ref	Expression
bnj1446	⊢ ((𝑄‘𝑧) = (𝐺‘𝑊) → ∀𝑑(𝑄‘𝑧) = (𝐺‘𝑊))

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

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

Proof of Theorem bnj1446

Step	Hyp	Ref	Expression
1		bnj1446.12	. . . . 5 ⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
2		bnj1446.10	. . . . . . 7 ⊢ 𝑃 = ∪ 𝐻
3		bnj1446.9	. . . . . . . . 9 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
4		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑑 pred(𝑥, 𝐴, 𝑅)
5		bnj1446.8	. . . . . . . . . . . 12 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
6		nfcv 2924	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑑𝑦
7		bnj1446.4	. . . . . . . . . . . . . 14 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
8		bnj1446.3	. . . . . . . . . . . . . . . . 17 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
9		nfre1 3289	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑑∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))
10	9	nfab 2930	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑑{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
11	8, 10	nfcxfr 2922	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑑𝐶
12	11	nfcri 2916	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑑 𝑓 ∈ 𝐶
13		nfv 1943	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑑dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
14	12, 13	nfan 1928	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑑(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
15	7, 14	nfxfr 1882	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑑𝜏
16	6, 15	nfsbcw 3765	. . . . . . . . . . . 12 ⊢ Ⅎ𝑑[𝑦 / 𝑥]𝜏
17	5, 16	nfxfr 1882	. . . . . . . . . . 11 ⊢ Ⅎ𝑑𝜏′
18	4, 17	nfrexw 3312	. . . . . . . . . 10 ⊢ Ⅎ𝑑∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′
19	18	nfab 2930	. . . . . . . . 9 ⊢ Ⅎ𝑑{𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
20	3, 19	nfcxfr 2922	. . . . . . . 8 ⊢ Ⅎ𝑑𝐻
21	20	nfuni 4878	. . . . . . 7 ⊢ Ⅎ𝑑∪ 𝐻
22	2, 21	nfcxfr 2922	. . . . . 6 ⊢ Ⅎ𝑑𝑃
23		nfcv 2924	. . . . . . . 8 ⊢ Ⅎ𝑑𝑥
24		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑑𝐺
25		bnj1446.11	. . . . . . . . . 10 ⊢ 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
26	22, 4	nfres 5979	. . . . . . . . . . 11 ⊢ Ⅎ𝑑(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
27	23, 26	nfop 4853	. . . . . . . . . 10 ⊢ Ⅎ𝑑⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
28	25, 27	nfcxfr 2922	. . . . . . . . 9 ⊢ Ⅎ𝑑𝑍
29	24, 28	nffv 6891	. . . . . . . 8 ⊢ Ⅎ𝑑(𝐺‘𝑍)
30	23, 29	nfop 4853	. . . . . . 7 ⊢ Ⅎ𝑑⟨𝑥, (𝐺‘𝑍)⟩
31	30	nfsn 4672	. . . . . 6 ⊢ Ⅎ𝑑{⟨𝑥, (𝐺‘𝑍)⟩}
32	22, 31	nfun 4123	. . . . 5 ⊢ Ⅎ𝑑(𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
33	1, 32	nfcxfr 2922	. . . 4 ⊢ Ⅎ𝑑𝑄
34		nfcv 2924	. . . 4 ⊢ Ⅎ𝑑𝑧
35	33, 34	nffv 6891	. . 3 ⊢ Ⅎ𝑑(𝑄‘𝑧)
36		bnj1446.13	. . . . 5 ⊢ 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
37		nfcv 2924	. . . . . . 7 ⊢ Ⅎ𝑑 pred(𝑧, 𝐴, 𝑅)
38	33, 37	nfres 5979	. . . . . 6 ⊢ Ⅎ𝑑(𝑄 ↾ pred(𝑧, 𝐴, 𝑅))
39	34, 38	nfop 4853	. . . . 5 ⊢ Ⅎ𝑑⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
40	36, 39	nfcxfr 2922	. . . 4 ⊢ Ⅎ𝑑𝑊
41	24, 40	nffv 6891	. . 3 ⊢ Ⅎ𝑑(𝐺‘𝑊)
42	35, 41	nfeq 2937	. 2 ⊢ Ⅎ𝑑(𝑄‘𝑧) = (𝐺‘𝑊)
43	42	nf5ri 2230	1 ⊢ ((𝑄‘𝑧) = (𝐺‘𝑊) → ∀𝑑(𝑄‘𝑧) = (𝐺‘𝑊))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3415  [wsbc 3743   ∪ cun 3902   ⊆ wss 3904  ∅c0 4285  {csn 4588  ⟨cop 4594  ∪ cuni 4871   class class class wbr 5108  dom cdm 5660   ↾ cres 5662   Fn wfn 6531  ‘cfv 6536   predc-bnj14 35086   FrSe w-bnj15 35090   trClc-bnj18 35092

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-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-xp 5666  df-res 5672  df-iota 6492  df-fv 6544

This theorem is used by:  bnj1450  35447  bnj1463  35452