Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tgldimor | Structured version Visualization version GIF version |
Description: Excluded-middle like statement allowing to treat dimension zero as a special case. (Contributed by Thierry Arnoux, 11-Apr-2019.) |
Ref | Expression |
---|---|
tgldimor.p | ⊢ 𝑃 = (𝐸‘𝐹) |
tgldimor.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
Ref | Expression |
---|---|
tgldimor | ⊢ (𝜑 → ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tgldimor.p | . . . . . 6 ⊢ 𝑃 = (𝐸‘𝐹) | |
2 | fvex 6113 | . . . . . 6 ⊢ (𝐸‘𝐹) ∈ V | |
3 | 1, 2 | eqeltri 2684 | . . . . 5 ⊢ 𝑃 ∈ V |
4 | hashv01gt1 12995 | . . . . 5 ⊢ (𝑃 ∈ V → ((#‘𝑃) = 0 ∨ (#‘𝑃) = 1 ∨ 1 < (#‘𝑃))) | |
5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ((#‘𝑃) = 0 ∨ (#‘𝑃) = 1 ∨ 1 < (#‘𝑃)) |
6 | 3orass 1034 | . . . 4 ⊢ (((#‘𝑃) = 0 ∨ (#‘𝑃) = 1 ∨ 1 < (#‘𝑃)) ↔ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 1 < (#‘𝑃)))) | |
7 | 5, 6 | mpbi 219 | . . 3 ⊢ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 1 < (#‘𝑃))) |
8 | 1p1e2 11011 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
9 | 1z 11284 | . . . . . . . . 9 ⊢ 1 ∈ ℤ | |
10 | nn0z 11277 | . . . . . . . . 9 ⊢ ((#‘𝑃) ∈ ℕ0 → (#‘𝑃) ∈ ℤ) | |
11 | zltp1le 11304 | . . . . . . . . 9 ⊢ ((1 ∈ ℤ ∧ (#‘𝑃) ∈ ℤ) → (1 < (#‘𝑃) ↔ (1 + 1) ≤ (#‘𝑃))) | |
12 | 9, 10, 11 | sylancr 694 | . . . . . . . 8 ⊢ ((#‘𝑃) ∈ ℕ0 → (1 < (#‘𝑃) ↔ (1 + 1) ≤ (#‘𝑃))) |
13 | 12 | biimpac 502 | . . . . . . 7 ⊢ ((1 < (#‘𝑃) ∧ (#‘𝑃) ∈ ℕ0) → (1 + 1) ≤ (#‘𝑃)) |
14 | 8, 13 | syl5eqbrr 4619 | . . . . . 6 ⊢ ((1 < (#‘𝑃) ∧ (#‘𝑃) ∈ ℕ0) → 2 ≤ (#‘𝑃)) |
15 | 2re 10967 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
16 | 15 | rexri 9976 | . . . . . . . . 9 ⊢ 2 ∈ ℝ* |
17 | pnfge 11840 | . . . . . . . . 9 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
18 | 16, 17 | ax-mp 5 | . . . . . . . 8 ⊢ 2 ≤ +∞ |
19 | breq2 4587 | . . . . . . . 8 ⊢ ((#‘𝑃) = +∞ → (2 ≤ (#‘𝑃) ↔ 2 ≤ +∞)) | |
20 | 18, 19 | mpbiri 247 | . . . . . . 7 ⊢ ((#‘𝑃) = +∞ → 2 ≤ (#‘𝑃)) |
21 | 20 | adantl 481 | . . . . . 6 ⊢ ((1 < (#‘𝑃) ∧ (#‘𝑃) = +∞) → 2 ≤ (#‘𝑃)) |
22 | hashnn0pnf 12992 | . . . . . . 7 ⊢ (𝑃 ∈ V → ((#‘𝑃) ∈ ℕ0 ∨ (#‘𝑃) = +∞)) | |
23 | 3, 22 | mp1i 13 | . . . . . 6 ⊢ (1 < (#‘𝑃) → ((#‘𝑃) ∈ ℕ0 ∨ (#‘𝑃) = +∞)) |
24 | 14, 21, 23 | mpjaodan 823 | . . . . 5 ⊢ (1 < (#‘𝑃) → 2 ≤ (#‘𝑃)) |
25 | 24 | orim2i 539 | . . . 4 ⊢ (((#‘𝑃) = 1 ∨ 1 < (#‘𝑃)) → ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))) |
26 | 25 | orim2i 539 | . . 3 ⊢ (((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 1 < (#‘𝑃))) → ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)))) |
27 | 7, 26 | mp1i 13 | . 2 ⊢ (𝜑 → ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)))) |
28 | tgldimor.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
29 | ne0i 3880 | . . . 4 ⊢ (𝐴 ∈ 𝑃 → 𝑃 ≠ ∅) | |
30 | hasheq0 13015 | . . . . . . 7 ⊢ (𝑃 ∈ V → ((#‘𝑃) = 0 ↔ 𝑃 = ∅)) | |
31 | 3, 30 | ax-mp 5 | . . . . . 6 ⊢ ((#‘𝑃) = 0 ↔ 𝑃 = ∅) |
32 | 31 | biimpi 205 | . . . . 5 ⊢ ((#‘𝑃) = 0 → 𝑃 = ∅) |
33 | 32 | necon3ai 2807 | . . . 4 ⊢ (𝑃 ≠ ∅ → ¬ (#‘𝑃) = 0) |
34 | 28, 29, 33 | 3syl 18 | . . 3 ⊢ (𝜑 → ¬ (#‘𝑃) = 0) |
35 | biorf 419 | . . 3 ⊢ (¬ (#‘𝑃) = 0 → (((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)) ↔ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))))) | |
36 | 34, 35 | syl 17 | . 2 ⊢ (𝜑 → (((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)) ↔ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))))) |
37 | 27, 36 | mpbird 246 | 1 ⊢ (𝜑 → ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∨ wo 382 ∧ wa 383 ∨ w3o 1030 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 Vcvv 3173 ∅c0 3874 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 0cc0 9815 1c1 9816 + caddc 9818 +∞cpnf 9950 ℝ*cxr 9952 < clt 9953 ≤ cle 9954 2c2 10947 ℕ0cn0 11169 ℤcz 11254 #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-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-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-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 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-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-fz 12198 df-hash 12980 |
This theorem is referenced by: tgifscgr 25203 tgcgrxfr 25213 tgbtwnconn3 25272 legtrid 25286 hpgerlem 25457 |
Copyright terms: Public domain | W3C validator |