Theorem bnj1118 32964

Description: Technical lemma for bnj69 32990. 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
bnj1118.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1118.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1118.5	⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
bnj1118.7	⊢ 𝐷 = (ω ∖ {∅})
bnj1118.18	⊢ (𝜎 ↔ ((𝑗 ∈ 𝑛 ∧ 𝑗 E 𝑖) → 𝜂′))
bnj1118.19	⊢ (𝜑0 ↔ (𝑖 ∈ 𝑛 ∧ 𝜎 ∧ 𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓))
bnj1118.26	⊢ (𝜂′ ↔ ((𝑓 ∈ 𝐾 ∧ 𝑗 ∈ dom 𝑓) → (𝑓‘𝑗) ⊆ 𝐵))

Assertion

Ref	Expression
bnj1118	⊢ ∃𝑗((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)

Distinct variable groups:   𝐴,𝑖,𝑗,𝑦   𝑦,𝐵   𝐷,𝑗   𝑅,𝑖,𝑗,𝑦   𝑓,𝑖,𝑗,𝑦   𝑖,𝑛,𝑗

Allowed substitution hints:   𝜑(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜓(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜒(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜃(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜏(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜎(𝑦,𝑓,𝑖,𝑗,𝑛)   𝐴(𝑓,𝑛)   𝐵(𝑓,𝑖,𝑗,𝑛)   𝐷(𝑦,𝑓,𝑖,𝑛)   𝑅(𝑓,𝑛)   𝐾(𝑦,𝑓,𝑖,𝑗,𝑛)   𝑋(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜂′(𝑦,𝑓,𝑖,𝑗,𝑛)   𝜑₀(𝑦,𝑓,𝑖,𝑗,𝑛)

Proof of Theorem bnj1118

Step	Hyp	Ref	Expression
1		bnj1118.3	. . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
2		bnj1118.7	. . . 4 ⊢ 𝐷 = (ω ∖ {∅})
3		bnj1118.18	. . . 4 ⊢ (𝜎 ↔ ((𝑗 ∈ 𝑛 ∧ 𝑗 E 𝑖) → 𝜂′))
4		bnj1118.19	. . . 4 ⊢ (𝜑0 ↔ (𝑖 ∈ 𝑛 ∧ 𝜎 ∧ 𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓))
5		bnj1118.26	. . . 4 ⊢ (𝜂′ ↔ ((𝑓 ∈ 𝐾 ∧ 𝑗 ∈ dom 𝑓) → (𝑓‘𝑗) ⊆ 𝐵))
6	1, 2, 3, 4, 5	bnj1110 32962	. . 3 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵))
7		ancl 545	. . 3 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → ((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → ((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵))))
8	6, 7	bnj101 32702	. 2 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → ((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)))
9		simpr2 1194	. . . 4 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → 𝑖 = suc 𝑗)
10	1	bnj1254 32789	. . . . . . 7 ⊢ (𝜒 → 𝜓)
11	10	3ad2ant3 1134	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → 𝜓)
12	11	ad2antrl 725	. . . . 5 ⊢ ((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → 𝜓)
13	12	adantr 481	. . . 4 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → 𝜓)
14	1	bnj1232 32783	. . . . . . . . 9 ⊢ (𝜒 → 𝑛 ∈ 𝐷)
15	14	3ad2ant3 1134	. . . . . . . 8 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → 𝑛 ∈ 𝐷)
16	15	ad2antrl 725	. . . . . . 7 ⊢ ((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → 𝑛 ∈ 𝐷)
17	16	adantr 481	. . . . . 6 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → 𝑛 ∈ 𝐷)
18		simpr1 1193	. . . . . 6 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → 𝑗 ∈ 𝑛)
19	2	bnj923 32748	. . . . . . . 8 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω)
20	19	anim1i 615	. . . . . . 7 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑗 ∈ 𝑛) → (𝑛 ∈ ω ∧ 𝑗 ∈ 𝑛))
21	20	ancomd 462	. . . . . 6 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑗 ∈ 𝑛) → (𝑗 ∈ 𝑛 ∧ 𝑛 ∈ ω))
22	17, 18, 21	syl2anc 584	. . . . 5 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → (𝑗 ∈ 𝑛 ∧ 𝑛 ∈ ω))
23		elnn 7723	. . . . 5 ⊢ ((𝑗 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑗 ∈ ω)
24	22, 23	syl 17	. . . 4 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → 𝑗 ∈ ω)
25	4	bnj1232 32783	. . . . . 6 ⊢ (𝜑0 → 𝑖 ∈ 𝑛)
26	25	adantl 482	. . . . 5 ⊢ (((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → 𝑖 ∈ 𝑛)
27	26	ad2antlr 724	. . . 4 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → 𝑖 ∈ 𝑛)
28	9, 13, 24, 27	bnj951 32755	. . 3 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → (𝑖 = suc 𝑗 ∧ 𝜓 ∧ 𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛))
29		bnj1118.5	. . . . . . 7 ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
30	29	simp2bi 1145	. . . . . 6 ⊢ (𝜏 → TrFo(𝐵, 𝐴, 𝑅))
31	30	3ad2ant2 1133	. . . . 5 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒) → TrFo(𝐵, 𝐴, 𝑅))
32	31	ad2antrl 725	. . . 4 ⊢ ((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → TrFo(𝐵, 𝐴, 𝑅))
33		simp3 1137	. . . 4 ⊢ ((𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵) → (𝑓‘𝑗) ⊆ 𝐵)
34	32, 33	anim12i 613	. . 3 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → ( TrFo(𝐵, 𝐴, 𝑅) ∧ (𝑓‘𝑗) ⊆ 𝐵))
35		bnj256 32685	. . . . 5 ⊢ ((𝑖 = suc 𝑗 ∧ 𝜓 ∧ 𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛) ↔ ((𝑖 = suc 𝑗 ∧ 𝜓) ∧ (𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛)))
36		bnj1118.2	. . . . . . . . . 10 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
37	36	bnj1112 32963	. . . . . . . . 9 ⊢ (𝜓 ↔ ∀𝑗((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
38	37	biimpi 215	. . . . . . . 8 ⊢ (𝜓 → ∀𝑗((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
39	38	19.21bi 2182	. . . . . . 7 ⊢ (𝜓 → ((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
40		eleq1 2826	. . . . . . . . 9 ⊢ (𝑖 = suc 𝑗 → (𝑖 ∈ 𝑛 ↔ suc 𝑗 ∈ 𝑛))
41	40	anbi2d 629	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → ((𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛) ↔ (𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛)))
42		fveqeq2 6783	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → ((𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
43	41, 42	imbi12d 345	. . . . . . 7 ⊢ (𝑖 = suc 𝑗 → (((𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛) → (𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)) ↔ ((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
44	39, 43	syl5ibr 245	. . . . . 6 ⊢ (𝑖 = suc 𝑗 → (𝜓 → ((𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛) → (𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
45	44	imp31 418	. . . . 5 ⊢ (((𝑖 = suc 𝑗 ∧ 𝜓) ∧ (𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛)) → (𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))
46	35, 45	sylbi 216	. . . 4 ⊢ ((𝑖 = suc 𝑗 ∧ 𝜓 ∧ 𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛) → (𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))
47		df-bnj19 32676	. . . . . . 7 ⊢ ( TrFo(𝐵, 𝐴, 𝑅) ↔ ∀𝑦 ∈ 𝐵 pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵)
48		ssralv 3987	. . . . . . 7 ⊢ ((𝑓‘𝑗) ⊆ 𝐵 → (∀𝑦 ∈ 𝐵 pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵 → ∀𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵))
49	47, 48	syl5bi 241	. . . . . 6 ⊢ ((𝑓‘𝑗) ⊆ 𝐵 → ( TrFo(𝐵, 𝐴, 𝑅) → ∀𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵))
50	49	impcom 408	. . . . 5 ⊢ (( TrFo(𝐵, 𝐴, 𝑅) ∧ (𝑓‘𝑗) ⊆ 𝐵) → ∀𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵)
51		iunss 4975	. . . . 5 ⊢ (∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵 ↔ ∀𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵)
52	50, 51	sylibr 233	. . . 4 ⊢ (( TrFo(𝐵, 𝐴, 𝑅) ∧ (𝑓‘𝑗) ⊆ 𝐵) → ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵)
53		sseq1 3946	. . . . 5 ⊢ ((𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) → ((𝑓‘𝑖) ⊆ 𝐵 ↔ ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵))
54	53	biimpar 478	. . . 4 ⊢ (((𝑓‘𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ∧ ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐵) → (𝑓‘𝑖) ⊆ 𝐵)
55	46, 52, 54	syl2an 596	. . 3 ⊢ (((𝑖 = suc 𝑗 ∧ 𝜓 ∧ 𝑗 ∈ ω ∧ 𝑖 ∈ 𝑛) ∧ ( TrFo(𝐵, 𝐴, 𝑅) ∧ (𝑓‘𝑗) ⊆ 𝐵)) → (𝑓‘𝑖) ⊆ 𝐵)
56	28, 34, 55	syl2anc 584	. 2 ⊢ (((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) ∧ (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗 ∧ (𝑓‘𝑗) ⊆ 𝐵)) → (𝑓‘𝑖) ⊆ 𝐵)
57	8, 56	bnj1023 32760	1 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086  ∀wal 1537   = wceq 1539  ∃wex 1782   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  Vcvv 3432   ∖ cdif 3884   ⊆ wss 3887  ∅c0 4256  {csn 4561  ∪ ciun 4924   class class class wbr 5074   E cep 5494  dom cdm 5589  suc csuc 6268   Fn wfn 6428  ‘cfv 6433  ωcom 7712   ∧ w-bnj17 32665   predc-bnj14 32667   TrFow-bnj19 32675

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-tr 5192  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fn 6436  df-fv 6441  df-om 7713  df-bnj17 32666  df-bnj19 32676

This theorem is referenced by:  bnj1030  32967