| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nqerid | Structured version Visualization version GIF version | ||
| Description: Corollary of nqereu 10884: the function [Q] acts as the identity on members of Q. (Contributed by Mario Carneiro, 6-May-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nqerid | ⊢ (𝐴 ∈ Q → ([Q]‘𝐴) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nqerf 10885 | . . 3 ⊢ [Q]:(N × N)⟶Q | |
| 2 | ffun 6690 | . . 3 ⊢ ([Q]:(N × N)⟶Q → Fun [Q]) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ Fun [Q] |
| 4 | elpqn 10880 | . . 3 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N)) | |
| 5 | id 22 | . . 3 ⊢ (𝐴 ∈ Q → 𝐴 ∈ Q) | |
| 6 | enqer 10876 | . . . . 5 ⊢ ~Q Er (N × N) | |
| 7 | 6 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ Q → ~Q Er (N × N)) |
| 8 | 7, 4 | erref 8694 | . . 3 ⊢ (𝐴 ∈ Q → 𝐴 ~Q 𝐴) |
| 9 | df-erq 10868 | . . . . 5 ⊢ [Q] = ( ~Q ∩ ((N × N) × Q)) | |
| 10 | 9 | breqi 5105 | . . . 4 ⊢ (𝐴[Q]𝐴 ↔ 𝐴( ~Q ∩ ((N × N) × Q))𝐴) |
| 11 | brinxp2 5723 | . . . 4 ⊢ (𝐴( ~Q ∩ ((N × N) × Q))𝐴 ↔ ((𝐴 ∈ (N × N) ∧ 𝐴 ∈ Q) ∧ 𝐴 ~Q 𝐴)) | |
| 12 | 10, 11 | bitri 277 | . . 3 ⊢ (𝐴[Q]𝐴 ↔ ((𝐴 ∈ (N × N) ∧ 𝐴 ∈ Q) ∧ 𝐴 ~Q 𝐴)) |
| 13 | 4, 5, 8, 12 | syl21anbrc 1357 | . 2 ⊢ (𝐴 ∈ Q → 𝐴[Q]𝐴) |
| 14 | funbrfv 6911 | . 2 ⊢ (Fun [Q] → (𝐴[Q]𝐴 → ([Q]‘𝐴) = 𝐴)) | |
| 15 | 3, 13, 14 | mpsyl 68 | 1 ⊢ (𝐴 ∈ Q → ([Q]‘𝐴) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∩ cin 3903 class class class wbr 5099 × cxp 5643 Fun wfun 6511 ⟶wf 6513 ‘cfv 6517 Er wer 8670 Ncnpi 10799 ~Q ceq 10806 Qcnq 10807 [Q]cerq 10809 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-oadd 8436 df-omul 8437 df-er 8673 df-ni 10827 df-mi 10829 df-lti 10830 df-enq 10866 df-nq 10867 df-erq 10868 df-1nq 10871 |
| This theorem is referenced by: addassnq 10913 mulassnq 10914 distrnq 10916 mulidnq 10918 recmulnq 10919 1lt2nq 10928 ltexnq 10930 prlem934 10988 |
| Copyright terms: Public domain | W3C validator |