Theorem bnj1442 35545

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

Assertion

Ref	Expression
bnj1442	⊢ (𝜂 → (𝑄‘𝑧) = (𝐺‘𝑊))

Distinct variable group:   𝑥,𝐴

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

Proof of Theorem bnj1442

Step	Hyp	Ref	Expression
1		bnj1442.18	. . 3 ⊢ (𝜂 ↔ (𝜃 ∧ 𝑧 ∈ {𝑥}))
2		bnj1442.17	. . . 4 ⊢ (𝜃 ↔ (𝜒 ∧ 𝑧 ∈ 𝐸))
3		bnj1442.16	. . . . . 6 ⊢ (𝜒 → 𝑄 Fn ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
4	3	fnfund 6637	. . . . 5 ⊢ (𝜒 → Fun 𝑄)
5		opex 5443	. . . . . . . 8 ⊢ ⟨𝑥, (𝐺‘𝑍)⟩ ∈ V
6	5	snid 4626	. . . . . . 7 ⊢ ⟨𝑥, (𝐺‘𝑍)⟩ ∈ {⟨𝑥, (𝐺‘𝑍)⟩}
7		elun2 4132	. . . . . . 7 ⊢ (⟨𝑥, (𝐺‘𝑍)⟩ ∈ {⟨𝑥, (𝐺‘𝑍)⟩} → ⟨𝑥, (𝐺‘𝑍)⟩ ∈ (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
8	6, 7	ax-mp 5	. . . . . 6 ⊢ ⟨𝑥, (𝐺‘𝑍)⟩ ∈ (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
9		bnj1442.12	. . . . . 6 ⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
10	8, 9	eleqtrri 2861	. . . . 5 ⊢ ⟨𝑥, (𝐺‘𝑍)⟩ ∈ 𝑄
11		funopfv 6931	. . . . 5 ⊢ (Fun 𝑄 → (⟨𝑥, (𝐺‘𝑍)⟩ ∈ 𝑄 → (𝑄‘𝑥) = (𝐺‘𝑍)))
12	4, 10, 11	mpisyl 22	. . . 4 ⊢ (𝜒 → (𝑄‘𝑥) = (𝐺‘𝑍))
13	2, 12	bnj832 35255	. . 3 ⊢ (𝜃 → (𝑄‘𝑥) = (𝐺‘𝑍))
14	1, 13	bnj832 35255	. 2 ⊢ (𝜂 → (𝑄‘𝑥) = (𝐺‘𝑍))
15		elsni 4604	. . . 4 ⊢ (𝑧 ∈ {𝑥} → 𝑧 = 𝑥)
16	1, 15	simplbiim 514	. . 3 ⊢ (𝜂 → 𝑧 = 𝑥)
17	16	fveq2d 6886	. 2 ⊢ (𝜂 → (𝑄‘𝑧) = (𝑄‘𝑥))
18		bnj602 35411	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → pred(𝑧, 𝐴, 𝑅) = pred(𝑥, 𝐴, 𝑅))
19	18	reseq2d 5976	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑄 ↾ pred(𝑧, 𝐴, 𝑅)) = (𝑄 ↾ pred(𝑥, 𝐴, 𝑅)))
20	16, 19	syl 18	. . . . . 6 ⊢ (𝜂 → (𝑄 ↾ pred(𝑧, 𝐴, 𝑅)) = (𝑄 ↾ pred(𝑥, 𝐴, 𝑅)))
21	9	bnj931 35267	. . . . . . . . . 10 ⊢ 𝑃 ⊆ 𝑄
22	21	a1i 11	. . . . . . . . 9 ⊢ (𝜒 → 𝑃 ⊆ 𝑄)
23		bnj1442.7	. . . . . . . . . . . 12 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
24		bnj1442.6	. . . . . . . . . . . . 13 ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
25	24	simplbi 502	. . . . . . . . . . . 12 ⊢ (𝜓 → 𝑅 FrSe 𝐴)
26	23, 25	bnj835 35256	. . . . . . . . . . 11 ⊢ (𝜒 → 𝑅 FrSe 𝐴)
27		bnj1442.5	. . . . . . . . . . . 12 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
28	27, 23	bnj1212 35295	. . . . . . . . . . 11 ⊢ (𝜒 → 𝑥 ∈ 𝐴)
29		bnj906 35426	. . . . . . . . . . 11 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
30	26, 28, 29	syl2anc 596	. . . . . . . . . 10 ⊢ (𝜒 → pred(𝑥, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
31		bnj1442.15	. . . . . . . . . . 11 ⊢ (𝜒 → 𝑃 Fn trCl(𝑥, 𝐴, 𝑅))
32	31	fndmd 6641	. . . . . . . . . 10 ⊢ (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅))
33	30, 32	sseqtrrd 3971	. . . . . . . . 9 ⊢ (𝜒 → pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑃)
34	4, 22, 33	bnj1503 35345	. . . . . . . 8 ⊢ (𝜒 → (𝑄 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝑃 ↾ pred(𝑥, 𝐴, 𝑅)))
35	2, 34	bnj832 35255	. . . . . . 7 ⊢ (𝜃 → (𝑄 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝑃 ↾ pred(𝑥, 𝐴, 𝑅)))
36	1, 35	bnj832 35255	. . . . . 6 ⊢ (𝜂 → (𝑄 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝑃 ↾ pred(𝑥, 𝐴, 𝑅)))
37	20, 36	eqtrd 2797	. . . . 5 ⊢ (𝜂 → (𝑄 ↾ pred(𝑧, 𝐴, 𝑅)) = (𝑃 ↾ pred(𝑥, 𝐴, 𝑅)))
38	16, 37	opeq12d 4844	. . . 4 ⊢ (𝜂 → ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩ = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
39		bnj1442.13	. . . 4 ⊢ 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
40		bnj1442.11	. . . 4 ⊢ 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
41	38, 39, 40	3eqtr4g 2822	. . 3 ⊢ (𝜂 → 𝑊 = 𝑍)
42	41	fveq2d 6886	. 2 ⊢ (𝜂 → (𝐺‘𝑊) = (𝐺‘𝑍))
43	14, 17, 42	3eqtr4d 2807	1 ⊢ (𝜂 → (𝑄‘𝑧) = (𝐺‘𝑊))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3414  [wsbc 3742   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  {csn 4587  ⟨cop 4593  ∪ cuni 4870   class class class wbr 5107  dom cdm 5659   ↾ cres 5661  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537   predc-bnj14 35185   FrSe w-bnj15 35189   trClc-bnj18 35191

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-reg 9567  ax-inf2 9623

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-om 7866  df-1o 8458  df-bnj17 35184  df-bnj14 35186  df-bnj13 35188  df-bnj15 35190  df-bnj18 35192

This theorem is used by:  bnj1423  35547