![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nqereq | Structured version Visualization version GIF version |
Description: The function [Q] acts as a substitute for equivalence classes, and it satisfies the fundamental requirement for equivalence representatives: the representatives are equal iff the members are equivalent. (Contributed by Mario Carneiro, 6-May-2013.) (Revised by Mario Carneiro, 12-Aug-2015.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nqereq | ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ([Q]‘𝐴) = ([Q]‘𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nqercl 9937 | . . . . 5 ⊢ (𝐴 ∈ (N × N) → ([Q]‘𝐴) ∈ Q) | |
2 | 1 | 3ad2ant1 1127 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → ([Q]‘𝐴) ∈ Q) |
3 | nqercl 9937 | . . . . 5 ⊢ (𝐵 ∈ (N × N) → ([Q]‘𝐵) ∈ Q) | |
4 | 3 | 3ad2ant2 1128 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → ([Q]‘𝐵) ∈ Q) |
5 | enqer 9927 | . . . . . 6 ⊢ ~Q Er (N × N) | |
6 | 5 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → ~Q Er (N × N)) |
7 | nqerrel 9938 | . . . . . . 7 ⊢ (𝐴 ∈ (N × N) → 𝐴 ~Q ([Q]‘𝐴)) | |
8 | 7 | 3ad2ant1 1127 | . . . . . 6 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → 𝐴 ~Q ([Q]‘𝐴)) |
9 | simp3 1132 | . . . . . 6 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → 𝐴 ~Q 𝐵) | |
10 | 6, 8, 9 | ertr3d 7921 | . . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → ([Q]‘𝐴) ~Q 𝐵) |
11 | nqerrel 9938 | . . . . . 6 ⊢ (𝐵 ∈ (N × N) → 𝐵 ~Q ([Q]‘𝐵)) | |
12 | 11 | 3ad2ant2 1128 | . . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → 𝐵 ~Q ([Q]‘𝐵)) |
13 | 6, 10, 12 | ertrd 7919 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → ([Q]‘𝐴) ~Q ([Q]‘𝐵)) |
14 | enqeq 9940 | . . . 4 ⊢ ((([Q]‘𝐴) ∈ Q ∧ ([Q]‘𝐵) ∈ Q ∧ ([Q]‘𝐴) ~Q ([Q]‘𝐵)) → ([Q]‘𝐴) = ([Q]‘𝐵)) | |
15 | 2, 4, 13, 14 | syl3anc 1473 | . . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐴 ~Q 𝐵) → ([Q]‘𝐴) = ([Q]‘𝐵)) |
16 | 15 | 3expia 1114 | . 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ~Q 𝐵 → ([Q]‘𝐴) = ([Q]‘𝐵))) |
17 | 5 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ (𝐵 ∈ (N × N) ∧ ([Q]‘𝐴) = ([Q]‘𝐵))) → ~Q Er (N × N)) |
18 | 7 | adantr 472 | . . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ (𝐵 ∈ (N × N) ∧ ([Q]‘𝐴) = ([Q]‘𝐵))) → 𝐴 ~Q ([Q]‘𝐴)) |
19 | simprr 813 | . . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ (𝐵 ∈ (N × N) ∧ ([Q]‘𝐴) = ([Q]‘𝐵))) → ([Q]‘𝐴) = ([Q]‘𝐵)) | |
20 | 18, 19 | breqtrd 4822 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ (𝐵 ∈ (N × N) ∧ ([Q]‘𝐴) = ([Q]‘𝐵))) → 𝐴 ~Q ([Q]‘𝐵)) |
21 | 11 | ad2antrl 766 | . . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ (𝐵 ∈ (N × N) ∧ ([Q]‘𝐴) = ([Q]‘𝐵))) → 𝐵 ~Q ([Q]‘𝐵)) |
22 | 17, 20, 21 | ertr4d 7922 | . . 3 ⊢ ((𝐴 ∈ (N × N) ∧ (𝐵 ∈ (N × N) ∧ ([Q]‘𝐴) = ([Q]‘𝐵))) → 𝐴 ~Q 𝐵) |
23 | 22 | expr 644 | . 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (([Q]‘𝐴) = ([Q]‘𝐵) → 𝐴 ~Q 𝐵)) |
24 | 16, 23 | impbid 202 | 1 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ([Q]‘𝐴) = ([Q]‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 ∧ w3a 1072 = wceq 1624 ∈ wcel 2131 class class class wbr 4796 × cxp 5256 ‘cfv 6041 Er wer 7900 Ncnpi 9850 ~Q ceq 9857 Qcnq 9858 [Q]cerq 9860 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1863 ax-4 1878 ax-5 1980 ax-6 2046 ax-7 2082 ax-8 2133 ax-9 2140 ax-10 2160 ax-11 2175 ax-12 2188 ax-13 2383 ax-ext 2732 ax-sep 4925 ax-nul 4933 ax-pow 4984 ax-pr 5047 ax-un 7106 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1627 df-ex 1846 df-nf 1851 df-sb 2039 df-eu 2603 df-mo 2604 df-clab 2739 df-cleq 2745 df-clel 2748 df-nfc 2883 df-ne 2925 df-ral 3047 df-rex 3048 df-reu 3049 df-rmo 3050 df-rab 3051 df-v 3334 df-sbc 3569 df-csb 3667 df-dif 3710 df-un 3712 df-in 3714 df-ss 3721 df-pss 3723 df-nul 4051 df-if 4223 df-pw 4296 df-sn 4314 df-pr 4316 df-tp 4318 df-op 4320 df-uni 4581 df-iun 4666 df-br 4797 df-opab 4857 df-mpt 4874 df-tr 4897 df-id 5166 df-eprel 5171 df-po 5179 df-so 5180 df-fr 5217 df-we 5219 df-xp 5264 df-rel 5265 df-cnv 5266 df-co 5267 df-dm 5268 df-rn 5269 df-res 5270 df-ima 5271 df-pred 5833 df-ord 5879 df-on 5880 df-lim 5881 df-suc 5882 df-iota 6004 df-fun 6043 df-fn 6044 df-f 6045 df-f1 6046 df-fo 6047 df-f1o 6048 df-fv 6049 df-ov 6808 df-oprab 6809 df-mpt2 6810 df-om 7223 df-1st 7325 df-2nd 7326 df-wrecs 7568 df-recs 7629 df-rdg 7667 df-1o 7721 df-oadd 7725 df-omul 7726 df-er 7903 df-ni 9878 df-mi 9880 df-lti 9881 df-enq 9917 df-nq 9918 df-erq 9919 df-1nq 9922 |
This theorem is referenced by: adderpq 9962 mulerpq 9963 distrnq 9967 recmulnq 9970 ltexnq 9981 |
Copyright terms: Public domain | W3C validator |