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

Theorem fvmptnn04if 22214
Description: The function values of a mapping from the nonnegative integers with four distinct cases. (Contributed by AV, 10-Nov-2019.)
Hypotheses
Ref Expression
fvmptnn04if.g 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
fvmptnn04if.s (𝜑𝑆 ∈ ℕ)
fvmptnn04if.n (𝜑𝑁 ∈ ℕ0)
fvmptnn04if.y (𝜑𝑌𝑉)
fvmptnn04if.a ((𝜑𝑁 = 0) → 𝑌 = 𝑁 / 𝑛𝐴)
fvmptnn04if.b ((𝜑 ∧ 0 < 𝑁𝑁 < 𝑆) → 𝑌 = 𝑁 / 𝑛𝐵)
fvmptnn04if.c ((𝜑𝑁 = 𝑆) → 𝑌 = 𝑁 / 𝑛𝐶)
fvmptnn04if.d ((𝜑𝑆 < 𝑁) → 𝑌 = 𝑁 / 𝑛𝐷)
Assertion
Ref Expression
fvmptnn04if (𝜑 → (𝐺𝑁) = 𝑌)
Distinct variable groups:   𝑛,𝑁   𝑆,𝑛
Allowed substitution hints:   𝜑(𝑛)   𝐴(𝑛)   𝐵(𝑛)   𝐶(𝑛)   𝐷(𝑛)   𝐺(𝑛)   𝑉(𝑛)   𝑌(𝑛)

Proof of Theorem fvmptnn04if
StepHypRef Expression
1 fvmptnn04if.n . . 3 (𝜑𝑁 ∈ ℕ0)
2 csbif 4548 . . . . 5 𝑁 / 𝑛if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) = if([𝑁 / 𝑛]𝑛 = 0, 𝑁 / 𝑛𝐴, 𝑁 / 𝑛if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵)))
3 eqsbc1 3793 . . . . . . 7 (𝑁 ∈ ℕ0 → ([𝑁 / 𝑛]𝑛 = 0 ↔ 𝑁 = 0))
41, 3syl 17 . . . . . 6 (𝜑 → ([𝑁 / 𝑛]𝑛 = 0 ↔ 𝑁 = 0))
5 csbif 4548 . . . . . . 7 𝑁 / 𝑛if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵)) = if([𝑁 / 𝑛]𝑛 = 𝑆, 𝑁 / 𝑛𝐶, 𝑁 / 𝑛if(𝑆 < 𝑛, 𝐷, 𝐵))
6 eqsbc1 3793 . . . . . . . . 9 (𝑁 ∈ ℕ0 → ([𝑁 / 𝑛]𝑛 = 𝑆𝑁 = 𝑆))
71, 6syl 17 . . . . . . . 8 (𝜑 → ([𝑁 / 𝑛]𝑛 = 𝑆𝑁 = 𝑆))
8 csbif 4548 . . . . . . . . 9 𝑁 / 𝑛if(𝑆 < 𝑛, 𝐷, 𝐵) = if([𝑁 / 𝑛]𝑆 < 𝑛, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵)
9 sbcbr2g 5168 . . . . . . . . . . . 12 (𝑁 ∈ ℕ0 → ([𝑁 / 𝑛]𝑆 < 𝑛𝑆 < 𝑁 / 𝑛𝑛))
101, 9syl 17 . . . . . . . . . . 11 (𝜑 → ([𝑁 / 𝑛]𝑆 < 𝑛𝑆 < 𝑁 / 𝑛𝑛))
11 csbvarg 4396 . . . . . . . . . . . . 13 (𝑁 ∈ ℕ0𝑁 / 𝑛𝑛 = 𝑁)
121, 11syl 17 . . . . . . . . . . . 12 (𝜑𝑁 / 𝑛𝑛 = 𝑁)
1312breq2d 5122 . . . . . . . . . . 11 (𝜑 → (𝑆 < 𝑁 / 𝑛𝑛𝑆 < 𝑁))
1410, 13bitrd 279 . . . . . . . . . 10 (𝜑 → ([𝑁 / 𝑛]𝑆 < 𝑛𝑆 < 𝑁))
1514ifbid 4514 . . . . . . . . 9 (𝜑 → if([𝑁 / 𝑛]𝑆 < 𝑛, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵) = if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵))
168, 15eqtrid 2789 . . . . . . . 8 (𝜑𝑁 / 𝑛if(𝑆 < 𝑛, 𝐷, 𝐵) = if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵))
177, 16ifbieq2d 4517 . . . . . . 7 (𝜑 → if([𝑁 / 𝑛]𝑛 = 𝑆, 𝑁 / 𝑛𝐶, 𝑁 / 𝑛if(𝑆 < 𝑛, 𝐷, 𝐵)) = if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵)))
185, 17eqtrid 2789 . . . . . 6 (𝜑𝑁 / 𝑛if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵)) = if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵)))
194, 18ifbieq2d 4517 . . . . 5 (𝜑 → if([𝑁 / 𝑛]𝑛 = 0, 𝑁 / 𝑛𝐴, 𝑁 / 𝑛if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) = if(𝑁 = 0, 𝑁 / 𝑛𝐴, if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵))))
202, 19eqtrid 2789 . . . 4 (𝜑𝑁 / 𝑛if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) = if(𝑁 = 0, 𝑁 / 𝑛𝐴, if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵))))
21 fvmptnn04if.a . . . . . 6 ((𝜑𝑁 = 0) → 𝑌 = 𝑁 / 𝑛𝐴)
22 fvmptnn04if.y . . . . . . 7 (𝜑𝑌𝑉)
2322adantr 482 . . . . . 6 ((𝜑𝑁 = 0) → 𝑌𝑉)
2421, 23eqeltrrd 2839 . . . . 5 ((𝜑𝑁 = 0) → 𝑁 / 𝑛𝐴𝑉)
25 fvmptnn04if.c . . . . . . . . 9 ((𝜑𝑁 = 𝑆) → 𝑌 = 𝑁 / 𝑛𝐶)
2625eqcomd 2743 . . . . . . . 8 ((𝜑𝑁 = 𝑆) → 𝑁 / 𝑛𝐶 = 𝑌)
2726adantlr 714 . . . . . . 7 (((𝜑 ∧ ¬ 𝑁 = 0) ∧ 𝑁 = 𝑆) → 𝑁 / 𝑛𝐶 = 𝑌)
2822ad2antrr 725 . . . . . . 7 (((𝜑 ∧ ¬ 𝑁 = 0) ∧ 𝑁 = 𝑆) → 𝑌𝑉)
2927, 28eqeltrd 2838 . . . . . 6 (((𝜑 ∧ ¬ 𝑁 = 0) ∧ 𝑁 = 𝑆) → 𝑁 / 𝑛𝐶𝑉)
30 fvmptnn04if.d . . . . . . . . . 10 ((𝜑𝑆 < 𝑁) → 𝑌 = 𝑁 / 𝑛𝐷)
3130eqcomd 2743 . . . . . . . . 9 ((𝜑𝑆 < 𝑁) → 𝑁 / 𝑛𝐷 = 𝑌)
3231ad4ant14 751 . . . . . . . 8 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ 𝑆 < 𝑁) → 𝑁 / 𝑛𝐷 = 𝑌)
3322ad3antrrr 729 . . . . . . . 8 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ 𝑆 < 𝑁) → 𝑌𝑉)
3432, 33eqeltrd 2838 . . . . . . 7 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ 𝑆 < 𝑁) → 𝑁 / 𝑛𝐷𝑉)
35 simplll 774 . . . . . . . . 9 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝜑)
36 anass 470 . . . . . . . . . . . . 13 (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) ↔ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)))
3736bicomi 223 . . . . . . . . . . . 12 ((¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)) ↔ ((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁))
3837bianassc 642 . . . . . . . . . . 11 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) ↔ (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ∧ ¬ 𝑆 < 𝑁))
39 an32 645 . . . . . . . . . . . . 13 (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ↔ ((¬ 𝑁 = 0 ∧ 𝜑) ∧ ¬ 𝑁 = 𝑆))
40 ancom 462 . . . . . . . . . . . . . 14 ((¬ 𝑁 = 0 ∧ 𝜑) ↔ (𝜑 ∧ ¬ 𝑁 = 0))
4140anbi1i 625 . . . . . . . . . . . . 13 (((¬ 𝑁 = 0 ∧ 𝜑) ∧ ¬ 𝑁 = 𝑆) ↔ ((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆))
4239, 41bitri 275 . . . . . . . . . . . 12 (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ↔ ((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆))
4342anbi1i 625 . . . . . . . . . . 11 ((((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ∧ ¬ 𝑆 < 𝑁) ↔ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁))
4438, 43bitri 275 . . . . . . . . . 10 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) ↔ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁))
45 df-ne 2945 . . . . . . . . . . . . 13 (𝑁 ≠ 0 ↔ ¬ 𝑁 = 0)
46 elnnne0 12434 . . . . . . . . . . . . . . 15 (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0𝑁 ≠ 0))
47 nngt0 12191 . . . . . . . . . . . . . . 15 (𝑁 ∈ ℕ → 0 < 𝑁)
4846, 47sylbir 234 . . . . . . . . . . . . . 14 ((𝑁 ∈ ℕ0𝑁 ≠ 0) → 0 < 𝑁)
4948expcom 415 . . . . . . . . . . . . 13 (𝑁 ≠ 0 → (𝑁 ∈ ℕ0 → 0 < 𝑁))
5045, 49sylbir 234 . . . . . . . . . . . 12 𝑁 = 0 → (𝑁 ∈ ℕ0 → 0 < 𝑁))
5150adantr 482 . . . . . . . . . . 11 ((¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)) → (𝑁 ∈ ℕ0 → 0 < 𝑁))
521, 51mpan9 508 . . . . . . . . . 10 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 0 < 𝑁)
5344, 52sylbir 234 . . . . . . . . 9 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 0 < 𝑁)
541nn0red 12481 . . . . . . . . . . . 12 (𝜑𝑁 ∈ ℝ)
5554adantr 482 . . . . . . . . . . 11 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑁 ∈ ℝ)
56 fvmptnn04if.s . . . . . . . . . . . . 13 (𝜑𝑆 ∈ ℕ)
5756nnred 12175 . . . . . . . . . . . 12 (𝜑𝑆 ∈ ℝ)
5857adantr 482 . . . . . . . . . . 11 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑆 ∈ ℝ)
5954, 57lenltd 11308 . . . . . . . . . . . . . . 15 (𝜑 → (𝑁𝑆 ↔ ¬ 𝑆 < 𝑁))
6059biimprd 248 . . . . . . . . . . . . . 14 (𝜑 → (¬ 𝑆 < 𝑁𝑁𝑆))
6160adantld 492 . . . . . . . . . . . . 13 (𝜑 → ((¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁) → 𝑁𝑆))
6261adantld 492 . . . . . . . . . . . 12 (𝜑 → ((¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)) → 𝑁𝑆))
6362imp 408 . . . . . . . . . . 11 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑁𝑆)
64 nesym 3001 . . . . . . . . . . . . . 14 (𝑆𝑁 ↔ ¬ 𝑁 = 𝑆)
6564biimpri 227 . . . . . . . . . . . . 13 𝑁 = 𝑆𝑆𝑁)
6665adantr 482 . . . . . . . . . . . 12 ((¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁) → 𝑆𝑁)
6766ad2antll 728 . . . . . . . . . . 11 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑆𝑁)
6855, 58, 63, 67leneltd 11316 . . . . . . . . . 10 ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑁 < 𝑆)
6944, 68sylbir 234 . . . . . . . . 9 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝑁 < 𝑆)
70 fvmptnn04if.b . . . . . . . . . 10 ((𝜑 ∧ 0 < 𝑁𝑁 < 𝑆) → 𝑌 = 𝑁 / 𝑛𝐵)
7170eqcomd 2743 . . . . . . . . 9 ((𝜑 ∧ 0 < 𝑁𝑁 < 𝑆) → 𝑁 / 𝑛𝐵 = 𝑌)
7235, 53, 69, 71syl3anc 1372 . . . . . . . 8 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝑁 / 𝑛𝐵 = 𝑌)
7322ad3antrrr 729 . . . . . . . 8 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝑌𝑉)
7472, 73eqeltrd 2838 . . . . . . 7 ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝑁 / 𝑛𝐵𝑉)
7534, 74ifclda 4526 . . . . . 6 (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) → if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵) ∈ 𝑉)
7629, 75ifclda 4526 . . . . 5 ((𝜑 ∧ ¬ 𝑁 = 0) → if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵)) ∈ 𝑉)
7724, 76ifclda 4526 . . . 4 (𝜑 → if(𝑁 = 0, 𝑁 / 𝑛𝐴, if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵))) ∈ 𝑉)
7820, 77eqeltrd 2838 . . 3 (𝜑𝑁 / 𝑛if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) ∈ 𝑉)
79 fvmptnn04if.g . . . 4 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
8079fvmpts 6956 . . 3 ((𝑁 ∈ ℕ0𝑁 / 𝑛if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) ∈ 𝑉) → (𝐺𝑁) = 𝑁 / 𝑛if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
811, 78, 80syl2anc 585 . 2 (𝜑 → (𝐺𝑁) = 𝑁 / 𝑛if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
8221eqcomd 2743 . . 3 ((𝜑𝑁 = 0) → 𝑁 / 𝑛𝐴 = 𝑌)
8332, 72ifeqda 4527 . . . 4 (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) → if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵) = 𝑌)
8427, 83ifeqda 4527 . . 3 ((𝜑 ∧ ¬ 𝑁 = 0) → if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵)) = 𝑌)
8582, 84ifeqda 4527 . 2 (𝜑 → if(𝑁 = 0, 𝑁 / 𝑛𝐴, if(𝑁 = 𝑆, 𝑁 / 𝑛𝐶, if(𝑆 < 𝑁, 𝑁 / 𝑛𝐷, 𝑁 / 𝑛𝐵))) = 𝑌)
8681, 20, 853eqtrd 2781 1 (𝜑 → (𝐺𝑁) = 𝑌)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 397  w3a 1088   = wceq 1542  wcel 2107  wne 2944  [wsbc 3744  csb 3860  ifcif 4491   class class class wbr 5110  cmpt 5193  cfv 6501  cr 11057  0cc0 11058   < clt 11196  cle 11197  cn 12160  0cn0 12420
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2708  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677  ax-resscn 11115  ax-1cn 11116  ax-icn 11117  ax-addcl 11118  ax-addrcl 11119  ax-mulcl 11120  ax-mulrcl 11121  ax-mulcom 11122  ax-addass 11123  ax-mulass 11124  ax-distr 11125  ax-i2m1 11126  ax-1ne0 11127  ax-1rid 11128  ax-rnegex 11129  ax-rrecex 11130  ax-cnre 11131  ax-pre-lttri 11132  ax-pre-lttrn 11133  ax-pre-ltadd 11134  ax-pre-mulgt0 11135
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2890  df-ne 2945  df-nel 3051  df-ral 3066  df-rex 3075  df-reu 3357  df-rab 3411  df-v 3450  df-sbc 3745  df-csb 3861  df-dif 3918  df-un 3920  df-in 3922  df-ss 3932  df-pss 3934  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6258  df-ord 6325  df-on 6326  df-lim 6327  df-suc 6328  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-riota 7318  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7808  df-2nd 7927  df-frecs 8217  df-wrecs 8248  df-recs 8322  df-rdg 8361  df-er 8655  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11198  df-mnf 11199  df-xr 11200  df-ltxr 11201  df-le 11202  df-sub 11394  df-neg 11395  df-nn 12161  df-n0 12421
This theorem is referenced by:  fvmptnn04ifa  22215  fvmptnn04ifb  22216  fvmptnn04ifc  22217  fvmptnn04ifd  22218
  Copyright terms: Public domain W3C validator