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

Theorem seqomlem1 8439
Description: Lemma for seqω. The underlying recursion generates a sequence of pairs with the expected first values. (Contributed by Stefan O'Rear, 1-Nov-2014.) (Revised by Mario Carneiro, 23-Jun-2015.)
Hypothesis
Ref Expression
seqomlem.a 𝑄 = rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)
Assertion
Ref Expression
seqomlem1 (𝐴 ∈ ω → (𝑄𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
Distinct variable groups:   𝑄,𝑖,𝑣   𝐴,𝑖,𝑣   𝑖,𝐹,𝑣
Allowed substitution hints:   𝐼(𝑣, 𝑖)

Proof of Theorem seqomlem1
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6878 . . 3 (𝑎 = ∅ → (𝑄𝑎) = (𝑄‘∅))
2 id 23 . . . 4 (𝑎 = ∅ → 𝑎 = ∅)
3 2fveq3 6883 . . . 4 (𝑎 = ∅ → (2nd ‘(𝑄𝑎)) = (2nd ‘(𝑄‘∅)))
42, 3opeq12d 4841 . . 3 (𝑎 = ∅ → ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ = ⟨∅, (2nd ‘(𝑄‘∅))⟩)
51, 4eqeq12d 2776 . 2 (𝑎 = ∅ → ((𝑄𝑎) = ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ ↔ (𝑄‘∅) = ⟨∅, (2nd ‘(𝑄‘∅))⟩))
6 fveq2 6878 . . 3 (𝑎 = 𝑏 → (𝑄𝑎) = (𝑄𝑏))
7 id 23 . . . 4 (𝑎 = 𝑏𝑎 = 𝑏)
8 2fveq3 6883 . . . 4 (𝑎 = 𝑏 → (2nd ‘(𝑄𝑎)) = (2nd ‘(𝑄𝑏)))
97, 8opeq12d 4841 . . 3 (𝑎 = 𝑏 → ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ = ⟨𝑏, (2nd ‘(𝑄𝑏))⟩)
106, 9eqeq12d 2776 . 2 (𝑎 = 𝑏 → ((𝑄𝑎) = ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ ↔ (𝑄𝑏) = ⟨𝑏, (2nd ‘(𝑄𝑏))⟩))
11 fveq2 6878 . . 3 (𝑎 = suc 𝑏 → (𝑄𝑎) = (𝑄‘suc 𝑏))
12 id 23 . . . 4 (𝑎 = suc 𝑏𝑎 = suc 𝑏)
13 2fveq3 6883 . . . 4 (𝑎 = suc 𝑏 → (2nd ‘(𝑄𝑎)) = (2nd ‘(𝑄‘suc 𝑏)))
1412, 13opeq12d 4841 . . 3 (𝑎 = suc 𝑏 → ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ = ⟨suc 𝑏, (2nd ‘(𝑄‘suc 𝑏))⟩)
1511, 14eqeq12d 2776 . 2 (𝑎 = suc 𝑏 → ((𝑄𝑎) = ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ ↔ (𝑄‘suc 𝑏) = ⟨suc 𝑏, (2nd ‘(𝑄‘suc 𝑏))⟩))
16 fveq2 6878 . . 3 (𝑎 = 𝐴 → (𝑄𝑎) = (𝑄𝐴))
17 id 23 . . . 4 (𝑎 = 𝐴𝑎 = 𝐴)
18 2fveq3 6883 . . . 4 (𝑎 = 𝐴 → (2nd ‘(𝑄𝑎)) = (2nd ‘(𝑄𝐴)))
1917, 18opeq12d 4841 . . 3 (𝑎 = 𝐴 → ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
2016, 19eqeq12d 2776 . 2 (𝑎 = 𝐴 → ((𝑄𝑎) = ⟨𝑎, (2nd ‘(𝑄𝑎))⟩ ↔ (𝑄𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩))
21 seqomlem.a . . . . 5 𝑄 = rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)
2221fveq1i 6879 . . . 4 (𝑄‘∅) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘∅)
23 opex 5439 . . . . 5 ⟨∅, ( I ‘𝐼)⟩ ∈ V
2423rdg0 8410 . . . 4 (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘∅) = ⟨∅, ( I ‘𝐼)⟩
2522, 24eqtri 2783 . . 3 (𝑄‘∅) = ⟨∅, ( I ‘𝐼)⟩
26 0ex 5264 . . . . . . 7 ∅ ∈ V
27 fvex 6891 . . . . . . 7 ( I ‘𝐼) ∈ V
2826, 27op2nd 7995 . . . . . 6 (2nd ‘⟨∅, ( I ‘𝐼)⟩) = ( I ‘𝐼)
2928eqcomi 2769 . . . . 5 ( I ‘𝐼) = (2nd ‘⟨∅, ( I ‘𝐼)⟩)
3029opeq2i 4837 . . . 4 ⟨∅, ( I ‘𝐼)⟩ = ⟨∅, (2nd ‘⟨∅, ( I ‘𝐼)⟩)⟩
31 id 23 . . . 4 ((𝑄‘∅) = ⟨∅, ( I ‘𝐼)⟩ → (𝑄‘∅) = ⟨∅, ( I ‘𝐼)⟩)
32 fveq2 6878 . . . . 5 ((𝑄‘∅) = ⟨∅, ( I ‘𝐼)⟩ → (2nd ‘(𝑄‘∅)) = (2nd ‘⟨∅, ( I ‘𝐼)⟩))
3332opeq2d 4840 . . . 4 ((𝑄‘∅) = ⟨∅, ( I ‘𝐼)⟩ → ⟨∅, (2nd ‘(𝑄‘∅))⟩ = ⟨∅, (2nd ‘⟨∅, ( I ‘𝐼)⟩)⟩)
3430, 31, 333eqtr4a 2821 . . 3 ((𝑄‘∅) = ⟨∅, ( I ‘𝐼)⟩ → (𝑄‘∅) = ⟨∅, (2nd ‘(𝑄‘∅))⟩)
3525, 34ax-mp 5 . 2 (𝑄‘∅) = ⟨∅, (2nd ‘(𝑄‘∅))⟩
36 df-ov 7416 . . . . . 6 (𝑏(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝑏))) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝑏, (2nd ‘(𝑄𝑏))⟩)
37 fvex 6891 . . . . . . 7 (2nd ‘(𝑄𝑏)) ∈ V
38 suceq 6426 . . . . . . . . 9 (𝑖 = 𝑏 → suc 𝑖 = suc 𝑏)
39 oveq1 7420 . . . . . . . . 9 (𝑖 = 𝑏 → (𝑖𝐹𝑣) = (𝑏𝐹𝑣))
4038, 39opeq12d 4841 . . . . . . . 8 (𝑖 = 𝑏 → ⟨suc 𝑖, (𝑖𝐹𝑣)⟩ = ⟨suc 𝑏, (𝑏𝐹𝑣)⟩)
41 oveq2 7421 . . . . . . . . 9 (𝑣 = (2nd ‘(𝑄𝑏)) → (𝑏𝐹𝑣) = (𝑏𝐹(2nd ‘(𝑄𝑏))))
4241opeq2d 4840 . . . . . . . 8 (𝑣 = (2nd ‘(𝑄𝑏)) → ⟨suc 𝑏, (𝑏𝐹𝑣)⟩ = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)
43 eqid 2760 . . . . . . . 8 (𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩) = (𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)
44 opex 5439 . . . . . . . 8 ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ ∈ V
4540, 42, 43, 44ovmpo 7573 . . . . . . 7 ((𝑏 ∈ ω ∧ (2nd ‘(𝑄𝑏)) ∈ V) → (𝑏(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝑏))) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)
4637, 45mpan2 704 . . . . . 6 (𝑏 ∈ ω → (𝑏(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝑏))) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)
4736, 46eqtr3id 2809 . . . . 5 (𝑏 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝑏, (2nd ‘(𝑄𝑏))⟩) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)
48 fveqeq2 6887 . . . . 5 ((𝑄𝑏) = ⟨𝑏, (2nd ‘(𝑄𝑏))⟩ → (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ ↔ ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝑏, (2nd ‘(𝑄𝑏))⟩) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩))
4947, 48syl5ibrcom 250 . . . 4 (𝑏 ∈ ω → ((𝑄𝑏) = ⟨𝑏, (2nd ‘(𝑄𝑏))⟩ → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩))
50 vex 3454 . . . . . . . . . 10 𝑏 ∈ V
5150sucex 7805 . . . . . . . . 9 suc 𝑏 ∈ V
52 ovex 7446 . . . . . . . . 9 (𝑏𝐹(2nd ‘(𝑄𝑏))) ∈ V
5351, 52op2nd 7995 . . . . . . . 8 (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩) = (𝑏𝐹(2nd ‘(𝑄𝑏)))
5453eqcomi 2769 . . . . . . 7 (𝑏𝐹(2nd ‘(𝑄𝑏))) = (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)
5554a1i 11 . . . . . 6 (𝑏 ∈ ω → (𝑏𝐹(2nd ‘(𝑄𝑏))) = (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩))
5655opeq2d 4840 . . . . 5 (𝑏 ∈ ω → ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ = ⟨suc 𝑏, (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)⟩)
57 id 23 . . . . . 6 (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)
58 fveq2 6878 . . . . . . 7 (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ → (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏))) = (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩))
5958opeq2d 4840 . . . . . 6 (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ → ⟨suc 𝑏, (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))⟩ = ⟨suc 𝑏, (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)⟩)
6057, 59eqeq12d 2776 . . . . 5 (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ → (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))⟩ ↔ ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ = ⟨suc 𝑏, (2nd ‘⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩)⟩))
6156, 60syl5ibrcom 250 . . . 4 (𝑏 ∈ ω → (((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (𝑏𝐹(2nd ‘(𝑄𝑏)))⟩ → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))⟩))
6249, 61syld 48 . . 3 (𝑏 ∈ ω → ((𝑄𝑏) = ⟨𝑏, (2nd ‘(𝑄𝑏))⟩ → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))⟩))
63 frsuc 8426 . . . . 5 (𝑏 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝑏) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝑏)))
64 peano2 7886 . . . . . . 7 (𝑏 ∈ ω → suc 𝑏 ∈ ω)
6564fvresd 6898 . . . . . 6 (𝑏 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝑏) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘suc 𝑏))
6621fveq1i 6879 . . . . . 6 (𝑄‘suc 𝑏) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘suc 𝑏)
6765, 66eqtr4di 2813 . . . . 5 (𝑏 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝑏) = (𝑄‘suc 𝑏))
68 fvres 6897 . . . . . . 7 (𝑏 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝑏) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘𝑏))
6921fveq1i 6879 . . . . . . 7 (𝑄𝑏) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘𝑏)
7068, 69eqtr4di 2813 . . . . . 6 (𝑏 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝑏) = (𝑄𝑏))
7170fveq2d 6882 . . . . 5 (𝑏 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝑏)) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))
7263, 67, 713eqtr3d 2803 . . . 4 (𝑏 ∈ ω → (𝑄‘suc 𝑏) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))
7372fveq2d 6882 . . . . 5 (𝑏 ∈ ω → (2nd ‘(𝑄‘suc 𝑏)) = (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏))))
7473opeq2d 4840 . . . 4 (𝑏 ∈ ω → ⟨suc 𝑏, (2nd ‘(𝑄‘suc 𝑏))⟩ = ⟨suc 𝑏, (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))⟩)
7572, 74eqeq12d 2776 . . 3 (𝑏 ∈ ω → ((𝑄‘suc 𝑏) = ⟨suc 𝑏, (2nd ‘(𝑄‘suc 𝑏))⟩ ↔ ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)) = ⟨suc 𝑏, (2nd ‘((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝑏)))⟩))
7662, 75sylibrd 262 . 2 (𝑏 ∈ ω → ((𝑄𝑏) = ⟨𝑏, (2nd ‘(𝑄𝑏))⟩ → (𝑄‘suc 𝑏) = ⟨suc 𝑏, (2nd ‘(𝑄‘suc 𝑏))⟩))
775, 10, 15, 20, 35, 76finds 7893 1 (𝐴 ∈ ω → (𝑄𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  Vcvv 3450  c0 4279  cop 4590   I cid 5549  cres 5657  suc csuc 6359  cfv 6533  (class class class)co 7413  cmpo 7415  ωcom 7862  2nd c2nd 7985  reccrdg 8398
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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399
This theorem is used by:  seqomlem2  8440  seqomlem4  8442
  Copyright terms: Public domain W3C validator