Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > constr3lem2 | Structured version Visualization version GIF version |
Description: Lemma for constr3trl 26187 etc. (Contributed by Alexander van der Vekens, 10-Nov-2017.) |
Ref | Expression |
---|---|
constr3cycl.f | ⊢ 𝐹 = {〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉} |
constr3cycl.p | ⊢ 𝑃 = ({〈0, 𝐴〉, 〈1, 𝐵〉} ∪ {〈2, 𝐶〉, 〈3, 𝐴〉}) |
Ref | Expression |
---|---|
constr3lem2 | ⊢ (#‘𝐹) = 3 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | constr3cycl.f | . 2 ⊢ 𝐹 = {〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉} | |
2 | 0ne1 10965 | . . . . 5 ⊢ 0 ≠ 1 | |
3 | c0ex 9913 | . . . . . . 7 ⊢ 0 ∈ V | |
4 | fvex 6113 | . . . . . . 7 ⊢ (◡𝐸‘{𝐴, 𝐵}) ∈ V | |
5 | 3, 4 | opth1 4870 | . . . . . 6 ⊢ (〈0, (◡𝐸‘{𝐴, 𝐵})〉 = 〈1, (◡𝐸‘{𝐵, 𝐶})〉 → 0 = 1) |
6 | 5 | necon3i 2814 | . . . . 5 ⊢ (0 ≠ 1 → 〈0, (◡𝐸‘{𝐴, 𝐵})〉 ≠ 〈1, (◡𝐸‘{𝐵, 𝐶})〉) |
7 | 2, 6 | ax-mp 5 | . . . 4 ⊢ 〈0, (◡𝐸‘{𝐴, 𝐵})〉 ≠ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 |
8 | 1ne2 11117 | . . . . 5 ⊢ 1 ≠ 2 | |
9 | 1ex 9914 | . . . . . . 7 ⊢ 1 ∈ V | |
10 | fvex 6113 | . . . . . . 7 ⊢ (◡𝐸‘{𝐵, 𝐶}) ∈ V | |
11 | 9, 10 | opth1 4870 | . . . . . 6 ⊢ (〈1, (◡𝐸‘{𝐵, 𝐶})〉 = 〈2, (◡𝐸‘{𝐶, 𝐴})〉 → 1 = 2) |
12 | 11 | necon3i 2814 | . . . . 5 ⊢ (1 ≠ 2 → 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ≠ 〈2, (◡𝐸‘{𝐶, 𝐴})〉) |
13 | 8, 12 | ax-mp 5 | . . . 4 ⊢ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ≠ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 |
14 | 2ne0 10990 | . . . . 5 ⊢ 2 ≠ 0 | |
15 | 2ex 10969 | . . . . . . 7 ⊢ 2 ∈ V | |
16 | fvex 6113 | . . . . . . 7 ⊢ (◡𝐸‘{𝐶, 𝐴}) ∈ V | |
17 | 15, 16 | opth1 4870 | . . . . . 6 ⊢ (〈2, (◡𝐸‘{𝐶, 𝐴})〉 = 〈0, (◡𝐸‘{𝐴, 𝐵})〉 → 2 = 0) |
18 | 17 | necon3i 2814 | . . . . 5 ⊢ (2 ≠ 0 → 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ≠ 〈0, (◡𝐸‘{𝐴, 𝐵})〉) |
19 | 14, 18 | ax-mp 5 | . . . 4 ⊢ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ≠ 〈0, (◡𝐸‘{𝐴, 𝐵})〉 |
20 | 7, 13, 19 | 3pm3.2i 1232 | . . 3 ⊢ (〈0, (◡𝐸‘{𝐴, 𝐵})〉 ≠ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ∧ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ≠ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ∧ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ≠ 〈0, (◡𝐸‘{𝐴, 𝐵})〉) |
21 | fveq2 6103 | . . . . 5 ⊢ (𝐹 = {〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉} → (#‘𝐹) = (#‘{〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉})) | |
22 | 21 | eqeq1d 2612 | . . . 4 ⊢ (𝐹 = {〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉} → ((#‘𝐹) = 3 ↔ (#‘{〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉}) = 3)) |
23 | opex 4859 | . . . . 5 ⊢ 〈0, (◡𝐸‘{𝐴, 𝐵})〉 ∈ V | |
24 | opex 4859 | . . . . 5 ⊢ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ∈ V | |
25 | opex 4859 | . . . . 5 ⊢ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ∈ V | |
26 | hashtpg 13121 | . . . . 5 ⊢ ((〈0, (◡𝐸‘{𝐴, 𝐵})〉 ∈ V ∧ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ∈ V ∧ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ∈ V) → ((〈0, (◡𝐸‘{𝐴, 𝐵})〉 ≠ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ∧ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ≠ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ∧ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ≠ 〈0, (◡𝐸‘{𝐴, 𝐵})〉) ↔ (#‘{〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉}) = 3)) | |
27 | 23, 24, 25, 26 | mp3an 1416 | . . . 4 ⊢ ((〈0, (◡𝐸‘{𝐴, 𝐵})〉 ≠ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ∧ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ≠ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ∧ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ≠ 〈0, (◡𝐸‘{𝐴, 𝐵})〉) ↔ (#‘{〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉}) = 3) |
28 | 22, 27 | syl6rbbr 278 | . . 3 ⊢ (𝐹 = {〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉} → ((〈0, (◡𝐸‘{𝐴, 𝐵})〉 ≠ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ∧ 〈1, (◡𝐸‘{𝐵, 𝐶})〉 ≠ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ∧ 〈2, (◡𝐸‘{𝐶, 𝐴})〉 ≠ 〈0, (◡𝐸‘{𝐴, 𝐵})〉) ↔ (#‘𝐹) = 3)) |
29 | 20, 28 | mpbii 222 | . 2 ⊢ (𝐹 = {〈0, (◡𝐸‘{𝐴, 𝐵})〉, 〈1, (◡𝐸‘{𝐵, 𝐶})〉, 〈2, (◡𝐸‘{𝐶, 𝐴})〉} → (#‘𝐹) = 3) |
30 | 1, 29 | ax-mp 5 | 1 ⊢ (#‘𝐹) = 3 |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 Vcvv 3173 ∪ cun 3538 {cpr 4127 {ctp 4129 〈cop 4131 ◡ccnv 5037 ‘cfv 5804 0cc0 9815 1c1 9816 2c2 10947 3c3 10948 #chash 12979 |
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-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
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-nel 2783 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-int 4411 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-riota 6511 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-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-fz 12198 df-hash 12980 |
This theorem is referenced by: constr3trllem2 26179 constr3trllem3 26180 constr3trllem4 26181 constr3trllem5 26182 constr3pthlem1 26183 constr3pthlem3 26185 constr3cycllem1 26186 constr3cycl 26189 |
Copyright terms: Public domain | W3C validator |