Theorem bnj1447 32428

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

Assertion

Ref	Expression
bnj1447	⊢ ((𝑄‘𝑧) = (𝐺‘𝑊) → ∀𝑦(𝑄‘𝑧) = (𝐺‘𝑊))

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

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

Proof of Theorem bnj1447

Step	Hyp	Ref	Expression
1		bnj1447.12	. . . . 5 ⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
2		bnj1447.10	. . . . . . 7 ⊢ 𝑃 = ∪ 𝐻
3		bnj1447.9	. . . . . . . . 9 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
4		nfre1 3265	. . . . . . . . . 10 ⊢ Ⅎ𝑦∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′
5	4	nfab 2961	. . . . . . . . 9 ⊢ Ⅎ𝑦{𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
6	3, 5	nfcxfr 2953	. . . . . . . 8 ⊢ Ⅎ𝑦𝐻
7	6	nfuni 4807	. . . . . . 7 ⊢ Ⅎ𝑦∪ 𝐻
8	2, 7	nfcxfr 2953	. . . . . 6 ⊢ Ⅎ𝑦𝑃
9		nfcv 2955	. . . . . . . 8 ⊢ Ⅎ𝑦𝑥
10		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑦𝐺
11		bnj1447.11	. . . . . . . . . 10 ⊢ 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
12		nfcv 2955	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦 pred(𝑥, 𝐴, 𝑅)
13	8, 12	nfres 5820	. . . . . . . . . . 11 ⊢ Ⅎ𝑦(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
14	9, 13	nfop 4781	. . . . . . . . . 10 ⊢ Ⅎ𝑦⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
15	11, 14	nfcxfr 2953	. . . . . . . . 9 ⊢ Ⅎ𝑦𝑍
16	10, 15	nffv 6655	. . . . . . . 8 ⊢ Ⅎ𝑦(𝐺‘𝑍)
17	9, 16	nfop 4781	. . . . . . 7 ⊢ Ⅎ𝑦⟨𝑥, (𝐺‘𝑍)⟩
18	17	nfsn 4603	. . . . . 6 ⊢ Ⅎ𝑦{⟨𝑥, (𝐺‘𝑍)⟩}
19	8, 18	nfun 4092	. . . . 5 ⊢ Ⅎ𝑦(𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
20	1, 19	nfcxfr 2953	. . . 4 ⊢ Ⅎ𝑦𝑄
21		nfcv 2955	. . . 4 ⊢ Ⅎ𝑦𝑧
22	20, 21	nffv 6655	. . 3 ⊢ Ⅎ𝑦(𝑄‘𝑧)
23		bnj1447.13	. . . . 5 ⊢ 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
24		nfcv 2955	. . . . . . 7 ⊢ Ⅎ𝑦 pred(𝑧, 𝐴, 𝑅)
25	20, 24	nfres 5820	. . . . . 6 ⊢ Ⅎ𝑦(𝑄 ↾ pred(𝑧, 𝐴, 𝑅))
26	21, 25	nfop 4781	. . . . 5 ⊢ Ⅎ𝑦⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
27	23, 26	nfcxfr 2953	. . . 4 ⊢ Ⅎ𝑦𝑊
28	10, 27	nffv 6655	. . 3 ⊢ Ⅎ𝑦(𝐺‘𝑊)
29	22, 28	nfeq 2968	. 2 ⊢ Ⅎ𝑦(𝑄‘𝑧) = (𝐺‘𝑊)
30	29	nf5ri 2193	1 ⊢ ((𝑄‘𝑧) = (𝐺‘𝑊) → ∀𝑦(𝑄‘𝑧) = (𝐺‘𝑊))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084  ∀wal 1536   = wceq 1538  ∃wex 1781   ∈ wcel 2111  {cab 2776   ≠ wne 2987  ∀wral 3106  ∃wrex 3107  {crab 3110  [wsbc 3720   ∪ cun 3879   ⊆ wss 3881  ∅c0 4243  {csn 4525  ⟨cop 4531  ∪ cuni 4800   class class class wbr 5030  dom cdm 5519   ↾ cres 5521   Fn wfn 6319  ‘cfv 6324   predc-bnj14 32068   FrSe w-bnj15 32072   trClc-bnj18 32074

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-xp 5525  df-res 5531  df-iota 6283  df-fv 6332

This theorem is referenced by:  bnj1450  32432