Theorem bnj1452 35548

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

Assertion

Ref	Expression
bnj1452	⊢ (𝜒 → 𝐸 ∈ 𝐵)

Distinct variable groups:   𝐴,𝑑,𝑥,𝑧   𝐸,𝑑,𝑧   𝑅,𝑑,𝑥,𝑧   𝜒,𝑧

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

Proof of Theorem bnj1452

Step	Hyp	Ref	Expression
1		bnj1452.14	. . 3 ⊢ 𝐸 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
2		bnj1452.5	. . . . . 6 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
3		bnj1452.7	. . . . . 6 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
4	2, 3	bnj1212 35295	. . . . 5 ⊢ (𝜒 → 𝑥 ∈ 𝐴)
5	4	snssd 4750	. . . 4 ⊢ (𝜒 → {𝑥} ⊆ 𝐴)
6		bnj1147 35490	. . . . 5 ⊢ trCl(𝑥, 𝐴, 𝑅) ⊆ 𝐴
7	6	a1i 11	. . . 4 ⊢ (𝜒 → trCl(𝑥, 𝐴, 𝑅) ⊆ 𝐴)
8	5, 7	unssd 4141	. . 3 ⊢ (𝜒 → ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ⊆ 𝐴)
9	1, 8	eqsstrid 3972	. 2 ⊢ (𝜒 → 𝐸 ⊆ 𝐴)
10		elsni 4604	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥} → 𝑧 = 𝑥)
11	10	adantl 487	. . . . . . 7 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) → 𝑧 = 𝑥)
12		bnj602 35411	. . . . . . 7 ⊢ (𝑧 = 𝑥 → pred(𝑧, 𝐴, 𝑅) = pred(𝑥, 𝐴, 𝑅))
13	11, 12	syl 18	. . . . . 6 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) → pred(𝑧, 𝐴, 𝑅) = pred(𝑥, 𝐴, 𝑅))
14		bnj1452.6	. . . . . . . . . 10 ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
15	14	simplbi 502	. . . . . . . . 9 ⊢ (𝜓 → 𝑅 FrSe 𝐴)
16	3, 15	bnj835 35256	. . . . . . . 8 ⊢ (𝜒 → 𝑅 FrSe 𝐴)
17		bnj906 35426	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
18	16, 4, 17	syl2anc 596	. . . . . . 7 ⊢ (𝜒 → pred(𝑥, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
19	18	ad2antrr 739	. . . . . 6 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) → pred(𝑥, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
20	13, 19	eqsstrd 3968	. . . . 5 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) → pred(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
21		ssun4 4130	. . . . . 6 ⊢ ( pred(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅) → pred(𝑧, 𝐴, 𝑅) ⊆ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
22	21, 1	sseqtrrdi 3975	. . . . 5 ⊢ ( pred(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅) → pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)
23	20, 22	syl 18	. . . 4 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) → pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)
24	16	ad2antrr 739	. . . . . . 7 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → 𝑅 FrSe 𝐴)
25		simpr 490	. . . . . . . 8 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅))
26	6, 25	bnj1213 35294	. . . . . . 7 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → 𝑧 ∈ 𝐴)
27		bnj906 35426	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑧 ∈ 𝐴) → pred(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑧, 𝐴, 𝑅))
28	24, 26, 27	syl2anc 596	. . . . . 6 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → pred(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑧, 𝐴, 𝑅))
29	4	ad2antrr 739	. . . . . . 7 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → 𝑥 ∈ 𝐴)
30		bnj1125 35488	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → trCl(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
31	24, 29, 25, 30	syl3anc 1398	. . . . . 6 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → trCl(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
32	28, 31	sstrd 3944	. . . . 5 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → pred(𝑧, 𝐴, 𝑅) ⊆ trCl(𝑥, 𝐴, 𝑅))
33	32, 22	syl 18	. . . 4 ⊢ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)
34	1	bnj1424 35334	. . . . 5 ⊢ (𝑧 ∈ 𝐸 → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
35	34	adantl 487	. . . 4 ⊢ ((𝜒 ∧ 𝑧 ∈ 𝐸) → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
36	23, 33, 35	mpjaodan 973	. . 3 ⊢ ((𝜒 ∧ 𝑧 ∈ 𝐸) → pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)
37	36	ralrimiva 3156	. 2 ⊢ (𝜒 → ∀𝑧 ∈ 𝐸 pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)
38		vsnex 5404	. . . . . . . 8 ⊢ {𝑥} ∈ V
39	38	a1i 11	. . . . . . 7 ⊢ (𝜒 → {𝑥} ∈ V)
40		bnj893 35424	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → trCl(𝑥, 𝐴, 𝑅) ∈ V)
41	16, 4, 40	syl2anc 596	. . . . . . 7 ⊢ (𝜒 → trCl(𝑥, 𝐴, 𝑅) ∈ V)
42	39, 41	bnj1149 35288	. . . . . 6 ⊢ (𝜒 → ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ∈ V)
43	1, 42	eqeltrid 2866	. . . . 5 ⊢ (𝜒 → 𝐸 ∈ V)
44		bnj1452.1	. . . . . 6 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
45	44	bnj1454 35338	. . . . 5 ⊢ (𝐸 ∈ V → (𝐸 ∈ 𝐵 ↔ [𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)))
46	43, 45	syl 18	. . . 4 ⊢ (𝜒 → (𝐸 ∈ 𝐵 ↔ [𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)))
47		bnj602 35411	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → pred(𝑥, 𝐴, 𝑅) = pred(𝑧, 𝐴, 𝑅))
48	47	sseq1d 3965	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ( pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑 ↔ pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑))
49	48	cbvralvw 3242	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑 ↔ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑)
50	49	anbi2i 635	. . . . 5 ⊢ ((𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑) ↔ (𝑑 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑))
51	50	sbcbii 3798	. . . 4 ⊢ ([𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑) ↔ [𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑))
52	46, 51	bitrdi 290	. . 3 ⊢ (𝜒 → (𝐸 ∈ 𝐵 ↔ [𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑)))
53		sseq1 3959	. . . . . 6 ⊢ (𝑑 = 𝐸 → (𝑑 ⊆ 𝐴 ↔ 𝐸 ⊆ 𝐴))
54		sseq2 3960	. . . . . . 7 ⊢ (𝑑 = 𝐸 → ( pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑 ↔ pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸))
55	54	raleqbi1dv 3331	. . . . . 6 ⊢ (𝑑 = 𝐸 → (∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑 ↔ ∀𝑧 ∈ 𝐸 pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸))
56	53, 55	anbi12d 644	. . . . 5 ⊢ (𝑑 = 𝐸 → ((𝑑 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑) ↔ (𝐸 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐸 pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)))
57	56	sbcieg 3781	. . . 4 ⊢ (𝐸 ∈ V → ([𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑) ↔ (𝐸 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐸 pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)))
58	43, 57	syl 18	. . 3 ⊢ (𝜒 → ([𝐸 / 𝑑](𝑑 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑑 pred(𝑧, 𝐴, 𝑅) ⊆ 𝑑) ↔ (𝐸 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐸 pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)))
59	52, 58	bitrd 282	. 2 ⊢ (𝜒 → (𝐸 ∈ 𝐵 ↔ (𝐸 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐸 pred(𝑧, 𝐴, 𝑅) ⊆ 𝐸)))
60	9, 37, 59	mpbir2and 726	1 ⊢ (𝜒 → 𝐸 ∈ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3414  Vcvv 3453  [wsbc 3742   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  {csn 4587  ⟨cop 4593  ∪ cuni 4870   class class class wbr 5107  dom cdm 5659   ↾ cres 5661   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  df-bnj19 35194

This theorem is used by:  bnj1312  35554