Mathbox for Scott Fenton < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trpredrec Structured version   Visualization version   GIF version

Theorem trpredrec 31862
 Description: If 𝑌 is an 𝑅, 𝐴 transitive predecessor, then it is either an immediate predecessor or there is a transitive predecessor between 𝑌 and 𝑋. (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 31850 . 2 (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) ↔ ∃𝑖 ∈ ω 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖))
2 nn0suc 7132 . . . 4 (𝑖 ∈ ω → (𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗))
3 fveq2 6229 . . . . . . . . . . 11 (𝑖 = ∅ → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))
43eleq2d 2716 . . . . . . . . . 10 (𝑖 = ∅ → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ↔ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅)))
54anbi2d 740 . . . . . . . . 9 (𝑖 = ∅ → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) ↔ ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))))
65biimpd 219 . . . . . . . 8 (𝑖 = ∅ → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅))))
7 setlikespec 5739 . . . . . . . . . . 11 ((𝑋𝐴𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑋) ∈ V)
8 fr0g 7576 . . . . . . . . . . 11 (Pred(𝑅, 𝐴, 𝑋) ∈ V → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) = Pred(𝑅, 𝐴, 𝑋))
97, 8syl 17 . . . . . . . . . 10 ((𝑋𝐴𝑅 Se 𝐴) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) = Pred(𝑅, 𝐴, 𝑋))
109eleq2d 2716 . . . . . . . . 9 ((𝑋𝐴𝑅 Se 𝐴) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅) ↔ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)))
1110biimpa 500 . . . . . . . 8 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘∅)) → 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋))
126, 11syl6com 37 . . . . . . 7 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → (𝑖 = ∅ → 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)))
13 fveq2 6229 . . . . . . . . . . . . 13 (𝑖 = suc 𝑗 → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))
1413eleq2d 2716 . . . . . . . . . . . 12 (𝑖 = suc 𝑗 → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) ↔ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗)))
1514anbi2d 740 . . . . . . . . . . 11 (𝑖 = suc 𝑗 → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) ↔ ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))))
1615biimpd 219 . . . . . . . . . 10 (𝑖 = suc 𝑗 → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → ((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗))))
17 fvex 6239 . . . . . . . . . . . . . . . . 17 ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ∈ V
18 trpredlem1 31851 . . . . . . . . . . . . . . . . . . . . 21 (Pred(𝑅, 𝐴, 𝑋) ∈ V → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ 𝐴)
197, 18syl 17 . . . . . . . . . . . . . . . . . . . 20 ((𝑋𝐴𝑅 Se 𝐴) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ 𝐴)
2019sseld 3635 . . . . . . . . . . . . . . . . . . 19 ((𝑋𝐴𝑅 Se 𝐴) → (𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑧𝐴))
21 setlikespec 5739 . . . . . . . . . . . . . . . . . . . . 21 ((𝑧𝐴𝑅 Se 𝐴) → Pred(𝑅, 𝐴, 𝑧) ∈ V)
2221expcom 450 . . . . . . . . . . . . . . . . . . . 20 (𝑅 Se 𝐴 → (𝑧𝐴 → Pred(𝑅, 𝐴, 𝑧) ∈ V))
2322adantl 481 . . . . . . . . . . . . . . . . . . 19 ((𝑋𝐴𝑅 Se 𝐴) → (𝑧𝐴 → Pred(𝑅, 𝐴, 𝑧) ∈ V))
2420, 23syld 47 . . . . . . . . . . . . . . . . . 18 ((𝑋𝐴𝑅 Se 𝐴) → (𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → Pred(𝑅, 𝐴, 𝑧) ∈ V))
2524ralrimiv 2994 . . . . . . . . . . . . . . . . 17 ((𝑋𝐴𝑅 Se 𝐴) → ∀𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V)
26 iunexg 7185 . . . . . . . . . . . . . . . . 17 ((((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ∈ V ∧ ∀𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V) → 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V)
2717, 25, 26sylancr 696 . . . . . . . . . . . . . . . 16 ((𝑋𝐴𝑅 Se 𝐴) → 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V)
28 nfcv 2793 . . . . . . . . . . . . . . . . 17 𝑎Pred(𝑅, 𝐴, 𝑋)
29 nfcv 2793 . . . . . . . . . . . . . . . . 17 𝑎𝑗
30 nfmpt1 4780 . . . . . . . . . . . . . . . . . . . . 21 𝑎(𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦))
3130, 28nfrdg 7555 . . . . . . . . . . . . . . . . . . . 20 𝑎rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋))
32 nfcv 2793 . . . . . . . . . . . . . . . . . . . 20 𝑎ω
3331, 32nfres 5430 . . . . . . . . . . . . . . . . . . 19 𝑎(rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)
3433, 29nffv 6236 . . . . . . . . . . . . . . . . . 18 𝑎((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)
35 nfcv 2793 . . . . . . . . . . . . . . . . . 18 𝑎Pred(𝑅, 𝐴, 𝑧)
3634, 35nfiun 4580 . . . . . . . . . . . . . . . . 17 𝑎 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)
37 eqid 2651 . . . . . . . . . . . . . . . . 17 (rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω) = (rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)
38 predeq3 5722 . . . . . . . . . . . . . . . . . . 19 (𝑦 = 𝑧 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑧))
3938cbviunv 4591 . . . . . . . . . . . . . . . . . 18 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦) = 𝑧𝑎 Pred(𝑅, 𝐴, 𝑧)
40 iuneq1 4566 . . . . . . . . . . . . . . . . . 18 (𝑎 = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑧𝑎 Pred(𝑅, 𝐴, 𝑧) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4139, 40syl5eq 2697 . . . . . . . . . . . . . . . . 17 (𝑎 = ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4228, 29, 36, 37, 41frsucmpt 7578 . . . . . . . . . . . . . . . 16 ((𝑗 ∈ ω ∧ 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ∈ V) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4327, 42sylan2 490 . . . . . . . . . . . . . . 15 ((𝑗 ∈ ω ∧ (𝑋𝐴𝑅 Se 𝐴)) → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) = 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧))
4443eleq2d 2716 . . . . . . . . . . . . . 14 ((𝑗 ∈ ω ∧ (𝑋𝐴𝑅 Se 𝐴)) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) ↔ 𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)))
4544biimpd 219 . . . . . . . . . . . . 13 ((𝑗 ∈ ω ∧ (𝑋𝐴𝑅 Se 𝐴)) → (𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗) → 𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)))
4645expimpd 628 . . . . . . . . . . . 12 (𝑗 ∈ ω → (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘suc 𝑗)) → 𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧)))
47 eliun 4556 . . . . . . . . . . . . 13 (𝑌 𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)Pred(𝑅, 𝐴, 𝑧) ↔ ∃𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)𝑌 ∈ Pred(𝑅, 𝐴, 𝑧))
48 ssiun2 4595 . . . . . . . . . . . . . . . . . 18 (𝑗 ∈ ω → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ 𝑗 ∈ ω ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗))
49 dftrpred2 31843 . . . . . . . . . . . . . . . . . 18 TrPred(𝑅, 𝐴, 𝑋) = 𝑗 ∈ ω ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)
5048, 49syl6sseqr 3685 . . . . . . . . . . . . . . . . 17 (𝑗 ∈ ω → ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ⊆ TrPred(𝑅, 𝐴, 𝑋))
5150sseld 3635 . . . . . . . . . . . . . . . 16 (𝑗 ∈ ω → (𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) → 𝑧 ∈ TrPred(𝑅, 𝐴, 𝑋)))
52 vex 3234 . . . . . . . . . . . . . . . . . 18 𝑧 ∈ V
5352elpredim 5730 . . . . . . . . . . . . . . . . 17 (𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → 𝑌𝑅𝑧)
5453a1i 11 . . . . . . . . . . . . . . . 16 (𝑗 ∈ ω → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → 𝑌𝑅𝑧))
5551, 54anim12d 585 . . . . . . . . . . . . . . 15 (𝑗 ∈ ω → ((𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗) ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑧)) → (𝑧 ∈ TrPred(𝑅, 𝐴, 𝑋) ∧ 𝑌𝑅𝑧)))
5655reximdv2 3043 . . . . . . . . . . . . . 14 (𝑗 ∈ ω → (∃𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
5756com12 32 . . . . . . . . . . . . 13 (∃𝑧 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑗)𝑌 ∈ Pred(𝑅, 𝐴, 𝑧) → (𝑗 ∈ ω → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
5847, 57sylbi 207 . . . . . . . . . . . 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 3059 . . . . . . 7 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → (∃𝑗 ∈ ω 𝑖 = suc 𝑗 → ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧))
6412, 63orim12d 901 . . . . . 6 (((𝑋𝐴𝑅 Se 𝐴) ∧ 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖)) → ((𝑖 = ∅ ∨ ∃𝑗 ∈ ω 𝑖 = suc 𝑗) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
6564ex 449 . . . . 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 3059 . 2 ((𝑋𝐴𝑅 Se 𝐴) → (∃𝑖 ∈ ω 𝑌 ∈ ((rec((𝑎 ∈ V ↦ 𝑦𝑎 Pred(𝑅, 𝐴, 𝑦)), Pred(𝑅, 𝐴, 𝑋)) ↾ ω)‘𝑖) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
691, 68syl5bi 232 1 ((𝑋𝐴𝑅 Se 𝐴) → (𝑌 ∈ TrPred(𝑅, 𝐴, 𝑋) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∨ ∃𝑧 ∈ TrPred (𝑅, 𝐴, 𝑋)𝑌𝑅𝑧)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∨ wo 382   ∧ wa 383   = wceq 1523   ∈ wcel 2030  ∀wral 2941  ∃wrex 2942  Vcvv 3231   ⊆ wss 3607  ∅c0 3948  ∪ ciun 4552   class class class wbr 4685   ↦ cmpt 4762   Se wse 5100   ↾ cres 5145  Predcpred 5717  suc csuc 5763  ‘cfv 5926  ωcom 7107  reccrdg 7550  TrPredctrpred 31841 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-se 5103  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-om 7108  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-trpred 31842 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator