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

Theorem recmulnq 9665
Description: Relationship between reciprocal and multiplication on positive fractions. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.) (New usage is discouraged.)
Assertion
Ref Expression
recmulnq (𝐴 ∈ Q → ((*Q‘𝐴) = 𝐵 ↔ (𝐴 ·Q 𝐵) = 1Q))

Proof of Theorem recmulnq
Dummy variables 𝑥 𝑦 𝑠 𝑟 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6113 . . . 4 (*Q‘𝐴) ∈ V
21a1i 11 . . 3 (𝐴 ∈ Q → (*Q‘𝐴) ∈ V)
3 eleq1 2676 . . 3 ((*Q‘𝐴) = 𝐵 → ((*Q‘𝐴) ∈ V ↔ 𝐵 ∈ V))
42, 3syl5ibcom 234 . 2 (𝐴 ∈ Q → ((*Q‘𝐴) = 𝐵 → 𝐵 ∈ V))
5 id 22 . . . . . . 7 ((𝐴 ·Q 𝐵) = 1Q → (𝐴 ·Q 𝐵) = 1Q)
6 1nq 9629 . . . . . . 7 1Q ∈ Q
75, 6syl6eqel 2696 . . . . . 6 ((𝐴 ·Q 𝐵) = 1Q → (𝐴 ·Q 𝐵) ∈ Q)
8 mulnqf 9650 . . . . . . . 8 ·Q :(Q × Q)⟶Q
98fdmi 5965 . . . . . . 7 dom ·Q = (Q × Q)
10 0nnq 9625 . . . . . . 7 ¬ ∅ ∈ Q
119, 10ndmovrcl 6718 . . . . . 6 ((𝐴 ·Q 𝐵) ∈ Q → (𝐴 ∈ Q ∧ 𝐵 ∈ Q))
127, 11syl 17 . . . . 5 ((𝐴 ·Q 𝐵) = 1Q → (𝐴 ∈ Q ∧ 𝐵 ∈ Q))
1312simprd 478 . . . 4 ((𝐴 ·Q 𝐵) = 1Q → 𝐵 ∈ Q)
14 elex 3185 . . . 4 (𝐵 ∈ Q → 𝐵 ∈ V)
1513, 14syl 17 . . 3 ((𝐴 ·Q 𝐵) = 1Q → 𝐵 ∈ V)
1615a1i 11 . 2 (𝐴 ∈ Q → ((𝐴 ·Q 𝐵) = 1Q → 𝐵 ∈ V))
17 oveq1 6556 . . . . 5 (𝑥 = 𝐴 → (𝑥 ·Q 𝑦) = (𝐴 ·Q 𝑦))
1817eqeq1d 2612 . . . 4 (𝑥 = 𝐴 → ((𝑥 ·Q 𝑦) = 1Q ↔ (𝐴 ·Q 𝑦) = 1Q))
19 oveq2 6557 . . . . 5 (𝑦 = 𝐵 → (𝐴 ·Q 𝑦) = (𝐴 ·Q 𝐵))
2019eqeq1d 2612 . . . 4 (𝑦 = 𝐵 → ((𝐴 ·Q 𝑦) = 1Q ↔ (𝐴 ·Q 𝐵) = 1Q))
21 nqerid 9634 . . . . . . . . . 10 (𝑥 ∈ Q → ([Q]‘𝑥) = 𝑥)
22 relxp 5150 . . . . . . . . . . . 12 Rel (N × N)
23 elpqn 9626 . . . . . . . . . . . 12 (𝑥 ∈ Q → 𝑥 ∈ (N × N))
24 1st2nd 7105 . . . . . . . . . . . 12 ((Rel (N × N) ∧ 𝑥 ∈ (N × N)) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
2522, 23, 24sylancr 694 . . . . . . . . . . 11 (𝑥 ∈ Q → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
2625fveq2d 6107 . . . . . . . . . 10 (𝑥 ∈ Q → ([Q]‘𝑥) = ([Q]‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩))
2721, 26eqtr3d 2646 . . . . . . . . 9 (𝑥 ∈ Q → 𝑥 = ([Q]‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩))
2827oveq1d 6564 . . . . . . . 8 (𝑥 ∈ Q → (𝑥 ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = (([Q]‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩) ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)))
29 mulerpq 9658 . . . . . . . 8 (([Q]‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩) ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = ([Q]‘(⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ·pQ ⟨(2nd ‘𝑥), (1st ‘𝑥)⟩))
3028, 29syl6eq 2660 . . . . . . 7 (𝑥 ∈ Q → (𝑥 ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = ([Q]‘(⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ·pQ ⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)))
31 xp1st 7089 . . . . . . . . . . 11 (𝑥 ∈ (N × N) → (1st ‘𝑥) ∈ N)
3223, 31syl 17 . . . . . . . . . 10 (𝑥 ∈ Q → (1st ‘𝑥) ∈ N)
33 xp2nd 7090 . . . . . . . . . . 11 (𝑥 ∈ (N × N) → (2nd ‘𝑥) ∈ N)
3423, 33syl 17 . . . . . . . . . 10 (𝑥 ∈ Q → (2nd ‘𝑥) ∈ N)
35 mulpipq 9641 . . . . . . . . . 10 ((((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N) ∧ ((2nd ‘𝑥) ∈ N ∧ (1st ‘𝑥) ∈ N)) → (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ·pQ ⟨(2nd ‘𝑥), (1st ‘𝑥)⟩) = ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((2nd ‘𝑥) ·N (1st ‘𝑥))⟩)
3632, 34, 34, 32, 35syl22anc 1319 . . . . . . . . 9 (𝑥 ∈ Q → (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ·pQ ⟨(2nd ‘𝑥), (1st ‘𝑥)⟩) = ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((2nd ‘𝑥) ·N (1st ‘𝑥))⟩)
37 mulcompi 9597 . . . . . . . . . 10 ((2nd ‘𝑥) ·N (1st ‘𝑥)) = ((1st ‘𝑥) ·N (2nd ‘𝑥))
3837opeq2i 4344 . . . . . . . . 9 ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((2nd ‘𝑥) ·N (1st ‘𝑥))⟩ = ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩
3936, 38syl6eq 2660 . . . . . . . 8 (𝑥 ∈ Q → (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ·pQ ⟨(2nd ‘𝑥), (1st ‘𝑥)⟩) = ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩)
4039fveq2d 6107 . . . . . . 7 (𝑥 ∈ Q → ([Q]‘(⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ·pQ ⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = ([Q]‘⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩))
41 nqerid 9634 . . . . . . . . 9 (1Q ∈ Q → ([Q]‘1Q) = 1Q)
426, 41ax-mp 5 . . . . . . . 8 ([Q]‘1Q) = 1Q
43 mulclpi 9594 . . . . . . . . . . 11 (((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N) → ((1st ‘𝑥) ·N (2nd ‘𝑥)) ∈ N)
4432, 34, 43syl2anc 691 . . . . . . . . . 10 (𝑥 ∈ Q → ((1st ‘𝑥) ·N (2nd ‘𝑥)) ∈ N)
45 1nqenq 9663 . . . . . . . . . 10 (((1st ‘𝑥) ·N (2nd ‘𝑥)) ∈ N → 1Q ~Q ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩)
4644, 45syl 17 . . . . . . . . 9 (𝑥 ∈ Q → 1Q ~Q ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩)
47 elpqn 9626 . . . . . . . . . . 11 (1Q ∈ Q → 1Q ∈ (N × N))
486, 47ax-mp 5 . . . . . . . . . 10 1Q ∈ (N × N)
49 opelxpi 5072 . . . . . . . . . . 11 ((((1st ‘𝑥) ·N (2nd ‘𝑥)) ∈ N ∧ ((1st ‘𝑥) ·N (2nd ‘𝑥)) ∈ N) → ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩ ∈ (N × N))
5044, 44, 49syl2anc 691 . . . . . . . . . 10 (𝑥 ∈ Q → ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩ ∈ (N × N))
51 nqereq 9636 . . . . . . . . . 10 ((1Q ∈ (N × N) ∧ ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩ ∈ (N × N)) → (1Q ~Q ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩ ↔ ([Q]‘1Q) = ([Q]‘⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩)))
5248, 50, 51sylancr 694 . . . . . . . . 9 (𝑥 ∈ Q → (1Q ~Q ⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩ ↔ ([Q]‘1Q) = ([Q]‘⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩)))
5346, 52mpbid 221 . . . . . . . 8 (𝑥 ∈ Q → ([Q]‘1Q) = ([Q]‘⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩))
5442, 53syl5reqr 2659 . . . . . . 7 (𝑥 ∈ Q → ([Q]‘⟨((1st ‘𝑥) ·N (2nd ‘𝑥)), ((1st ‘𝑥) ·N (2nd ‘𝑥))⟩) = 1Q)
5530, 40, 543eqtrd 2648 . . . . . 6 (𝑥 ∈ Q → (𝑥 ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = 1Q)
56 fvex 6113 . . . . . . 7 ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩) ∈ V
57 oveq2 6557 . . . . . . . 8 (𝑦 = ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩) → (𝑥 ·Q 𝑦) = (𝑥 ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)))
5857eqeq1d 2612 . . . . . . 7 (𝑦 = ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩) → ((𝑥 ·Q 𝑦) = 1Q ↔ (𝑥 ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = 1Q))
5956, 58spcev 3273 . . . . . 6 ((𝑥 ·Q ([Q]‘⟨(2nd ‘𝑥), (1st ‘𝑥)⟩)) = 1Q → ∃𝑦(𝑥 ·Q 𝑦) = 1Q)
6055, 59syl 17 . . . . 5 (𝑥 ∈ Q → ∃𝑦(𝑥 ·Q 𝑦) = 1Q)
61 mulcomnq 9654 . . . . . . 7 (𝑟 ·Q 𝑠) = (𝑠 ·Q 𝑟)
62 mulassnq 9660 . . . . . . 7 ((𝑟 ·Q 𝑠) ·Q 𝑡) = (𝑟 ·Q (𝑠 ·Q 𝑡))
63 mulidnq 9664 . . . . . . 7 (𝑟 ∈ Q → (𝑟 ·Q 1Q) = 𝑟)
646, 9, 10, 61, 62, 63caovmo 6769 . . . . . 6 ∃*𝑦(𝑥 ·Q 𝑦) = 1Q
65 eu5 2484 . . . . . 6 (∃!𝑦(𝑥 ·Q 𝑦) = 1Q ↔ (∃𝑦(𝑥 ·Q 𝑦) = 1Q ∧ ∃*𝑦(𝑥 ·Q 𝑦) = 1Q))
6664, 65mpbiran2 956 . . . . 5 (∃!𝑦(𝑥 ·Q 𝑦) = 1Q ↔ ∃𝑦(𝑥 ·Q 𝑦) = 1Q)
6760, 66sylibr 223 . . . 4 (𝑥 ∈ Q → ∃!𝑦(𝑥 ·Q 𝑦) = 1Q)
68 cnvimass 5404 . . . . . . . 8 (◡ ·Q “ {1Q}) ⊆ dom ·Q
69 df-rq 9618 . . . . . . . 8 *Q = (◡ ·Q “ {1Q})
709eqcomi 2619 . . . . . . . 8 (Q × Q) = dom ·Q
7168, 69, 703sstr4i 3607 . . . . . . 7 *Q ⊆ (Q × Q)
72 relxp 5150 . . . . . . 7 Rel (Q × Q)
73 relss 5129 . . . . . . 7 (*Q ⊆ (Q × Q) → (Rel (Q × Q) → Rel *Q))
7471, 72, 73mp2 9 . . . . . 6 Rel *Q
7569eleq2i 2680 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ *Q ↔ ⟨𝑥, 𝑦⟩ ∈ (◡ ·Q “ {1Q}))
76 ffn 5958 . . . . . . . . 9 ( ·Q :(Q × Q)⟶Q → ·Q Fn (Q × Q))
77 fniniseg 6246 . . . . . . . . 9 ( ·Q Fn (Q × Q) → (⟨𝑥, 𝑦⟩ ∈ (◡ ·Q “ {1Q}) ↔ (⟨𝑥, 𝑦⟩ ∈ (Q × Q) ∧ ( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q)))
788, 76, 77mp2b 10 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (◡ ·Q “ {1Q}) ↔ (⟨𝑥, 𝑦⟩ ∈ (Q × Q) ∧ ( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q))
79 ancom 465 . . . . . . . . 9 ((⟨𝑥, 𝑦⟩ ∈ (Q × Q) ∧ ( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q) ↔ (( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q ∧ ⟨𝑥, 𝑦⟩ ∈ (Q × Q)))
80 ancom 465 . . . . . . . . . 10 ((𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q) ↔ ((𝑥 ·Q 𝑦) = 1Q ∧ 𝑥 ∈ Q))
81 eleq1 2676 . . . . . . . . . . . . . . 15 ((𝑥 ·Q 𝑦) = 1Q → ((𝑥 ·Q 𝑦) ∈ Q ↔ 1Q ∈ Q))
826, 81mpbiri 247 . . . . . . . . . . . . . 14 ((𝑥 ·Q 𝑦) = 1Q → (𝑥 ·Q 𝑦) ∈ Q)
839, 10ndmovrcl 6718 . . . . . . . . . . . . . 14 ((𝑥 ·Q 𝑦) ∈ Q → (𝑥 ∈ Q ∧ 𝑦 ∈ Q))
8482, 83syl 17 . . . . . . . . . . . . 13 ((𝑥 ·Q 𝑦) = 1Q → (𝑥 ∈ Q ∧ 𝑦 ∈ Q))
85 opelxpi 5072 . . . . . . . . . . . . 13 ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → ⟨𝑥, 𝑦⟩ ∈ (Q × Q))
8684, 85syl 17 . . . . . . . . . . . 12 ((𝑥 ·Q 𝑦) = 1Q → ⟨𝑥, 𝑦⟩ ∈ (Q × Q))
8784simpld 474 . . . . . . . . . . . 12 ((𝑥 ·Q 𝑦) = 1Q → 𝑥 ∈ Q)
8886, 872thd 254 . . . . . . . . . . 11 ((𝑥 ·Q 𝑦) = 1Q → (⟨𝑥, 𝑦⟩ ∈ (Q × Q) ↔ 𝑥 ∈ Q))
8988pm5.32i 667 . . . . . . . . . 10 (((𝑥 ·Q 𝑦) = 1Q ∧ ⟨𝑥, 𝑦⟩ ∈ (Q × Q)) ↔ ((𝑥 ·Q 𝑦) = 1Q ∧ 𝑥 ∈ Q))
90 df-ov 6552 . . . . . . . . . . . 12 (𝑥 ·Q 𝑦) = ( ·Q ‘⟨𝑥, 𝑦⟩)
9190eqeq1i 2615 . . . . . . . . . . 11 ((𝑥 ·Q 𝑦) = 1Q ↔ ( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q)
9291anbi1i 727 . . . . . . . . . 10 (((𝑥 ·Q 𝑦) = 1Q ∧ ⟨𝑥, 𝑦⟩ ∈ (Q × Q)) ↔ (( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q ∧ ⟨𝑥, 𝑦⟩ ∈ (Q × Q)))
9380, 89, 923bitr2ri 288 . . . . . . . . 9 ((( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q ∧ ⟨𝑥, 𝑦⟩ ∈ (Q × Q)) ↔ (𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q))
9479, 93bitri 263 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ (Q × Q) ∧ ( ·Q ‘⟨𝑥, 𝑦⟩) = 1Q) ↔ (𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q))
9575, 78, 943bitri 285 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ *Q ↔ (𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q))
9695a1i 11 . . . . . 6 (⊤ → (⟨𝑥, 𝑦⟩ ∈ *Q ↔ (𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q)))
9774, 96opabbi2dv 5193 . . . . 5 (⊤ → *Q = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q)})
9897trud 1484 . . . 4 *Q = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ Q ∧ (𝑥 ·Q 𝑦) = 1Q)}
9918, 20, 67, 98fvopab3g 6187 . . 3 ((𝐴 ∈ Q ∧ 𝐵 ∈ V) → ((*Q‘𝐴) = 𝐵 ↔ (𝐴 ·Q 𝐵) = 1Q))
10099ex 449 . 2 (𝐴 ∈ Q → (𝐵 ∈ V → ((*Q‘𝐴) = 𝐵 ↔ (𝐴 ·Q 𝐵) = 1Q)))
1014, 16, 100pm5.21ndd 368 1 (𝐴 ∈ Q → ((*Q‘𝐴) = 𝐵 ↔ (𝐴 ·Q 𝐵) = 1Q))
Colors of variables: wff setvar class
Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475  ⊤wtru 1476  ∃wex 1695   ∈ wcel 1977  ∃!weu 2458  ∃*wmo 2459  Vcvv 3173   ⊆ wss 3540  {csn 4125  ⟨cop 4131   class class class wbr 4583  {copab 4642   × cxp 5036  ◡ccnv 5037  dom cdm 5038   “ cima 5041  Rel wrel 5043   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  1st c1st 7057  2nd c2nd 7058  Ncnpi 9545   ·N cmi 9547   ·pQ cmpq 9550   ~Q ceq 9552  Qcnq 9553  1Qc1q 9554  [Q]cerq 9555   ·Q cmq 9557  *Qcrq 9558
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-omul 7452  df-er 7629  df-ni 9573  df-mi 9575  df-lti 9576  df-mpq 9610  df-enq 9612  df-nq 9613  df-erq 9614  df-mq 9616  df-1nq 9617  df-rq 9618
This theorem is referenced by:  recidnq  9666  recrecnq  9668  reclem3pr  9750
  Copyright terms: Public domain W3C validator