Theorem trpredlem1 31727

Description: Technical lemma for transitive predecessors properties. All values of the transitive predecessors' underlying function are subsets of the base set. (Contributed by Scott Fenton, 28-Apr-2012.)

Assertion

Ref	Expression
trpredlem1	⊢ (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴)

Distinct variable groups:   𝐴,𝑎,𝑦   𝑅,𝑎,𝑦   𝑋,𝑎

Allowed substitution hints:   𝐴(𝑖)   𝐵(𝑦,𝑖,𝑎)   𝑅(𝑖)   𝑋(𝑦,𝑖)

Proof of Theorem trpredlem1

Dummy variables 𝑒 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nn0suc 7090	. . 3 ⊢ (𝑖 ∈ ω → (𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗))
2		fr0g 7531	. . . . . 6 ⊢ (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) = Pred(𝑅, 𝐴, 𝑋))
3		predss 5687	. . . . . 6 ⊢ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝐴
4	2, 3	syl6eqss 3655	. . . . 5 ⊢ (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) ⊆ 𝐴)
5		fveq2 6191	. . . . . 6 ⊢ (𝑖 = ∅ → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))
6	5	sseq1d 3632	. . . . 5 ⊢ (𝑖 = ∅ → (((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴 ↔ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) ⊆ 𝐴))
7	4, 6	syl5ibr 236	. . . 4 ⊢ (𝑖 = ∅ → (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴))
8		nfcv 2764	. . . . . . . . . . 11 ⊢ Ⅎ𝑎Pred(𝑅, 𝐴, 𝑋)
9		nfcv 2764	. . . . . . . . . . 11 ⊢ Ⅎ𝑎𝑗
10		nfmpt1 4747	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑎(𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦))
11	10, 8	nfrdg 7510	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑎rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋))
12		nfcv 2764	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑎ω
13	11, 12	nfres 5398	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑎(rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)
14	13, 9	nffv 6198	. . . . . . . . . . . 12 ⊢ Ⅎ𝑎((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)
15		nfcv 2764	. . . . . . . . . . . 12 ⊢ Ⅎ𝑎Pred(𝑅, 𝐴, 𝑒)
16	14, 15	nfiun 4548	. . . . . . . . . . 11 ⊢ Ⅎ𝑎∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒)
17		predeq3 5684	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑒 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑒))
18	17	cbviunv 4559	. . . . . . . . . . . . 13 ⊢ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦) = ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒)
19	18	mpteq2i 4741	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)) = (𝑎 ∈ V ↦ ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒))
20		rdgeq1 7507	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)) = (𝑎 ∈ V ↦ ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒)) → rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) = rec((𝑎 ∈ V ↦ ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒)), Pred(𝑅, 𝐴, 𝑋)))
21		reseq1 5390	. . . . . . . . . . . 12 ⊢ (rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) = rec((𝑎 ∈ V ↦ ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒)), Pred(𝑅, 𝐴, 𝑋)) → (rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω) = (rec((𝑎 ∈ V ↦ ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω))
22	19, 20, 21	mp2b 10	. . . . . . . . . . 11 ⊢ (rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω) = (rec((𝑎 ∈ V ↦ ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)
23		iuneq1 4534	. . . . . . . . . . 11 ⊢ (𝑎 = ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → ∪ 𝑒 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑒) = ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒))
24	8, 9, 16, 22, 23	frsucmpt 7533	. . . . . . . . . 10 ⊢ ((𝑗 ∈ ω ∧ ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ∈ V) → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒))
25		iunss 4561	. . . . . . . . . . 11 ⊢ (∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ⊆ 𝐴 ↔ ∀𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ⊆ 𝐴)
26		predss 5687	. . . . . . . . . . . 12 ⊢ Pred(𝑅, 𝐴, 𝑒) ⊆ 𝐴
27	26	a1i 11	. . . . . . . . . . 11 ⊢ (𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → Pred(𝑅, 𝐴, 𝑒) ⊆ 𝐴)
28	25, 27	mprgbir 2927	. . . . . . . . . 10 ⊢ ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ⊆ 𝐴
29	24, 28	syl6eqss 3655	. . . . . . . . 9 ⊢ ((𝑗 ∈ ω ∧ ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ∈ V) → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ⊆ 𝐴)
30	8, 9, 16, 22, 23	frsucmptn 7534	. . . . . . . . . . 11 ⊢ (¬ ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ∈ V → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = ∅)
31	30	adantl 482	. . . . . . . . . 10 ⊢ ((𝑗 ∈ ω ∧ ¬ ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ∈ V) → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = ∅)
32		0ss 3972	. . . . . . . . . 10 ⊢ ∅ ⊆ 𝐴
33	31, 32	syl6eqss 3655	. . . . . . . . 9 ⊢ ((𝑗 ∈ ω ∧ ¬ ∪ 𝑒 ∈ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑒) ∈ V) → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ⊆ 𝐴)
34	29, 33	pm2.61dan 832	. . . . . . . 8 ⊢ (𝑗 ∈ ω → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ⊆ 𝐴)
35	34	adantr 481	. . . . . . 7 ⊢ ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ⊆ 𝐴)
36		fveq2 6191	. . . . . . . . 9 ⊢ (𝑖 = suc 𝑗 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))
37	36	sseq1d 3632	. . . . . . . 8 ⊢ (𝑖 = suc 𝑗 → (((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴 ↔ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ⊆ 𝐴))
38	37	adantl 482	. . . . . . 7 ⊢ ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) → (((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴 ↔ ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ⊆ 𝐴))
39	35, 38	mpbird 247	. . . . . 6 ⊢ ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴)
40	39	rexlimiva 3028	. . . . 5 ⊢ (∃𝑗 ∈ ω 𝑖 = suc 𝑗 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴)
41	40	a1d 25	. . . 4 ⊢ (∃𝑗 ∈ ω 𝑖 = suc 𝑗 → (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴))
42	7, 41	jaoi 394	. . 3 ⊢ ((𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗) → (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴))
43	1, 42	syl 17	. 2 ⊢ (𝑖 ∈ ω → (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴))
44		nfvres 6224	. . . 4 ⊢ (¬ 𝑖 ∈ ω → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ∅)
45	44, 32	syl6eqss 3655	. . 3 ⊢ (¬ 𝑖 ∈ ω → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴)
46	45	a1d 25	. 2 ⊢ (¬ 𝑖 ∈ ω → (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴))
47	43, 46	pm2.61i 176	1 ⊢ (Pred(𝑅, 𝐴, 𝑋) ∈ 𝐵 → ((rec((𝑎 ∈ V ↦ ∪ 𝑦 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ⊆ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∨ wo 383   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∃wrex 2913  Vcvv 3200   ⊆ wss 3574  ∅c0 3915  ∪ ciun 4520   ↦ cmpt 4729   ↾ cres 5116  Predcpred 5679  suc csuc 5725  ‘cfv 5888  ωcom 7065  reccrdg 7505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506

This theorem is referenced by:  trpredss  31729  trpredtr  31730  trpredmintr  31731  trpredrec  31738