MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  trpredrec Structured version   Visualization version   GIF version

Theorem trpredrec 9342
Description: A transitive predecessor of 𝑋 is either an immediate predecessor of 𝑋 or an immediate predecessor of a transitive predecessor of 𝑋. (Contributed by Scott Fenton, 9-May-2012.) (Revised by Mario Carneiro, 26-Jun-2015.)
Assertion
Ref Expression
trpredrec ((𝑋𝐴𝑅 Se 𝐴) → (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
Distinct variable groups:   𝑧,𝐴   𝑧,𝑅   𝑧,𝑋   𝑧,𝑌

Proof of Theorem trpredrec
Dummy variables 𝑎 𝑖 𝑗 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eltrpred 9331 . 2 (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) ↔ ∃𝑖 ∈ ω 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖))
2 nn0suc 7673 . . . 4 (𝑖 ∈ ω → (𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗))
3 fveq2 6717 . . . . . . . . . . 11 (𝑖 = ∅ → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))
43eleq2d 2823 . . . . . . . . . 10 (𝑖 = ∅ → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ↔ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅)))
54anbi2d 632 . . . . . . . . 9 (𝑖 = ∅ → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) ↔ ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))))
65biimpd 232 . . . . . . . 8 (𝑖 = ∅ → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))))
7 setlikespec 6183 . . . . . . . . . . 11 ((𝑋𝐴𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑋) ∈ V)
8 fr0g 8171 . . . . . . . . . . 11 (Pred(𝑅, 𝐴, 𝑋) ∈ V → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) = Pred(𝑅, 𝐴, 𝑋))
97, 8syl 17 . . . . . . . . . 10 ((𝑋𝐴𝑅 Se 𝐴) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) = Pred(𝑅, 𝐴, 𝑋))
109eleq2d 2823 . . . . . . . . 9 ((𝑋𝐴𝑅 Se 𝐴) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) ↔ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)))
1110biimpa 480 . . . . . . . 8 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅)) → 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋))
126, 11syl6com 37 . . . . . . 7 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → (𝑖 = ∅ → 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)))
13 fveq2 6717 . . . . . . . . . . . . 13 (𝑖 = suc 𝑗 → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))
1413eleq2d 2823 . . . . . . . . . . . 12 (𝑖 = suc 𝑗 → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ↔ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗)))
1514anbi2d 632 . . . . . . . . . . 11 (𝑖 = suc 𝑗 → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) ↔ ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))))
1615biimpd 232 . . . . . . . . . 10 (𝑖 = suc 𝑗 → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))))
17 fvex 6730 . . . . . . . . . . . . . . . . 17 ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ∈ V
18 trpredlem1 9332 . . . . . . . . . . . . . . . . . . . . 21 (Pred(𝑅, 𝐴, 𝑋) ∈ V → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ 𝐴)
197, 18syl 17 . . . . . . . . . . . . . . . . . . . 20 ((𝑋𝐴𝑅 Se 𝐴) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ 𝐴)
2019sseld 3900 . . . . . . . . . . . . . . . . . . 19 ((𝑋𝐴𝑅 Se 𝐴) → (𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑧𝐴))
21 setlikespec 6183 . . . . . . . . . . . . . . . . . . . . 21 ((𝑧𝐴𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑧) ∈ V)
2221expcom 417 . . . . . . . . . . . . . . . . . . . 20 (𝑅 Se 𝐴 → (𝑧𝐴 → Pred(𝑅, 𝐴, 𝑧) ∈ V))
2322adantl 485 . . . . . . . . . . . . . . . . . . 19 ((𝑋𝐴𝑅 Se 𝐴) → (𝑧𝐴 → Pred(𝑅, 𝐴, 𝑧) ∈ V))
2420, 23syld 47 . . . . . . . . . . . . . . . . . 18 ((𝑋𝐴𝑅 Se 𝐴) → (𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → Pred(𝑅, 𝐴, 𝑧) ∈ V))
2524ralrimiv 3104 . . . . . . . . . . . . . . . . 17 ((𝑋𝐴𝑅 Se 𝐴) → ∀𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V)
26 iunexg 7736 . . . . . . . . . . . . . . . . 17 ((((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ∈ V ∧ ∀𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V) → 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V)
2717, 25, 26sylancr 590 . . . . . . . . . . . . . . . 16 ((𝑋𝐴𝑅 Se 𝐴) → 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V)
28 nfcv 2904 . . . . . . . . . . . . . . . . 17 𝑎Pred(𝑅, 𝐴, 𝑋)
29 nfcv 2904 . . . . . . . . . . . . . . . . 17 𝑎𝑗
30 nfmpt1 5153 . . . . . . . . . . . . . . . . . . . . 21 𝑎(𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦))
3130, 28nfrdg 8150 . . . . . . . . . . . . . . . . . . . 20 𝑎rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋))
32 nfcv 2904 . . . . . . . . . . . . . . . . . . . 20 𝑎ω
3331, 32nfres 5853 . . . . . . . . . . . . . . . . . . 19 𝑎(rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)
3433, 29nffv 6727 . . . . . . . . . . . . . . . . . 18 𝑎((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)
35 nfcv 2904 . . . . . . . . . . . . . . . . . 18 𝑎Pred(𝑅, 𝐴, 𝑧)
3634, 35nfiun 4934 . . . . . . . . . . . . . . . . 17 𝑎 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)
37 eqid 2737 . . . . . . . . . . . . . . . . 17 (rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω) = (rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)
38 predeq3 6164 . . . . . . . . . . . . . . . . . . 19 (𝑦 = 𝑧 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑧))
3938cbviunv 4949 . . . . . . . . . . . . . . . . . 18 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦) = 𝑧𝑎 Pred(𝑅, 𝐴, 𝑧)
40 iuneq1 4920 . . . . . . . . . . . . . . . . . 18 (𝑎 = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑧𝑎 Pred(𝑅, 𝐴, 𝑧) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4139, 40eqtrid 2789 . . . . . . . . . . . . . . . . 17 (𝑎 = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4228, 29, 36, 37, 41frsucmpt 8173 . . . . . . . . . . . . . . . 16 ((𝑗 ∈ ω ∧ 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4327, 42sylan2 596 . . . . . . . . . . . . . . 15 ((𝑗 ∈ ω ∧ (𝑋𝐴𝑅 Se 𝐴)) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4443eleq2d 2823 . . . . . . . . . . . . . 14 ((𝑗 ∈ ω ∧ (𝑋𝐴𝑅 Se 𝐴)) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ↔ 𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)))
4544biimpd 232 . . . . . . . . . . . . 13 ((𝑗 ∈ ω ∧ (𝑋𝐴𝑅 Se 𝐴)) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) → 𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)))
4645expimpd 457 . . . . . . . . . . . 12 (𝑗 ∈ ω → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗)) → 𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)))
47 eliun 4908 . . . . . . . . . . . . 13 (𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ↔ ∃𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)𝑌 ∈ Pred(𝑅, 𝐴, 𝑧))
48 ssiun2 4956 . . . . . . . . . . . . . . . . . 18 (𝑗 ∈ ω → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ 𝑗 ∈ ω ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗))
49 dftrpred2 9324 . . . . . . . . . . . . . . . . . 18 TrPred(𝑅, 𝐴, 𝑋) = 𝑗 ∈ ω ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)
5048, 49sseqtrrdi 3952 . . . . . . . . . . . . . . . . 17 (𝑗 ∈ ω → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ TrPred(𝑅, 𝐴, 𝑋))
5150sseld 3900 . . . . . . . . . . . . . . . 16 (𝑗 ∈ ω → (𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑧 ∈ TrPred(𝑅, 𝐴, 𝑋)))
52 vex 3412 . . . . . . . . . . . . . . . . . 18 𝑧 ∈ V
5352elpredim 6175 . . . . . . . . . . . . . . . . 17 (𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → 𝑌𝑅𝑧)
5453a1i 11 . . . . . . . . . . . . . . . 16 (𝑗 ∈ ω → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → 𝑌𝑅𝑧))
5551, 54anim12d 612 . . . . . . . . . . . . . . 15 (𝑗 ∈ ω → ((𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑧)) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑋) ∧ 𝑌𝑅𝑧)))
5655reximdv2 3190 . . . . . . . . . . . . . 14 (𝑗 ∈ ω → (∃𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
5756com12 32 . . . . . . . . . . . . 13 (∃𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → (𝑗 ∈ ω → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
5847, 57sylbi 220 . . . . . . . . . . . 12 (𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) → (𝑗 ∈ ω → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
5946, 58syl6com 37 . . . . . . . . . . 11 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗)) → (𝑗 ∈ ω → (𝑗 ∈ ω → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
6059pm2.43d 53 . . . . . . . . . 10 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗)) → (𝑗 ∈ ω → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
6116, 60syl6com 37 . . . . . . . . 9 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → (𝑖 = suc 𝑗 → (𝑗 ∈ ω → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
6261com23 86 . . . . . . . 8 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → (𝑗 ∈ ω → (𝑖 = suc 𝑗 → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
6362rexlimdv 3202 . . . . . . 7 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → (∃𝑗 ∈ ω 𝑖 = suc 𝑗 → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
6412, 63orim12d 965 . . . . . 6 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → ((𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
6564ex 416 . . . . 5 ((𝑋𝐴𝑅 Se 𝐴) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) → ((𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))))
6665com23 86 . . . 4 ((𝑋𝐴𝑅 Se 𝐴) → ((𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))))
672, 66syl5 34 . . 3 ((𝑋𝐴𝑅 Se 𝐴) → (𝑖 ∈ ω → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))))
6867rexlimdv 3202 . 2 ((𝑋𝐴𝑅 Se 𝐴) → (∃𝑖 ∈ ω 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
691, 68syl5bi 245 1 ((𝑋𝐴𝑅 Se 𝐴) → (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wo 847   = wceq 1543  wcel 2110  wral 3061  wrex 3062  Vcvv 3408  wss 3866  c0 4237   ciun 4904   class class class wbr 5053  cmpt 5135   Se wse 5507  cres 5553  Predcpred 6159  suc csuc 6215  cfv 6380  ωcom 7644  reccrdg 8145  TrPredctrpred 9322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5179  ax-sep 5192  ax-nul 5199  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-pss 3885  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4820  df-iun 4906  df-br 5054  df-opab 5116  df-mpt 5136  df-tr 5162  df-id 5455  df-eprel 5460  df-po 5468  df-so 5469  df-fr 5509  df-se 5510  df-we 5511  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-pred 6160  df-ord 6216  df-on 6217  df-lim 6218  df-suc 6219  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-om 7645  df-wrecs 8047  df-recs 8108  df-rdg 8146  df-trpred 9323
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator