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 6201 | . . . . . 6 ⊢ (𝐸‘𝐹) ∈ V | |
3 | 1, 2 | eqeltri 2697 | . . . . 5 ⊢ 𝑃 ∈ V |
4 | hashv01gt1 13133 | . . . . 5 ⊢ (𝑃 ∈ V → ((#‘𝑃) = 0 ∨ (#‘𝑃) = 1 ∨ 1 < (#‘𝑃))) | |
5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ ((#‘𝑃) = 0 ∨ (#‘𝑃) = 1 ∨ 1 < (#‘𝑃)) |
6 | 3orass 1040 | . . . 4 ⊢ (((#‘𝑃) = 0 ∨ (#‘𝑃) = 1 ∨ 1 < (#‘𝑃)) ↔ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 1 < (#‘𝑃)))) | |
7 | 5, 6 | mpbi 220 | . . 3 ⊢ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 1 < (#‘𝑃))) |
8 | 1p1e2 11134 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
9 | 1z 11407 | . . . . . . . . 9 ⊢ 1 ∈ ℤ | |
10 | nn0z 11400 | . . . . . . . . 9 ⊢ ((#‘𝑃) ∈ ℕ0 → (#‘𝑃) ∈ ℤ) | |
11 | zltp1le 11427 | . . . . . . . . 9 ⊢ ((1 ∈ ℤ ∧ (#‘𝑃) ∈ ℤ) → (1 < (#‘𝑃) ↔ (1 + 1) ≤ (#‘𝑃))) | |
12 | 9, 10, 11 | sylancr 695 | . . . . . . . 8 ⊢ ((#‘𝑃) ∈ ℕ0 → (1 < (#‘𝑃) ↔ (1 + 1) ≤ (#‘𝑃))) |
13 | 12 | biimpac 503 | . . . . . . 7 ⊢ ((1 < (#‘𝑃) ∧ (#‘𝑃) ∈ ℕ0) → (1 + 1) ≤ (#‘𝑃)) |
14 | 8, 13 | syl5eqbrr 4689 | . . . . . 6 ⊢ ((1 < (#‘𝑃) ∧ (#‘𝑃) ∈ ℕ0) → 2 ≤ (#‘𝑃)) |
15 | 2re 11090 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
16 | 15 | rexri 10097 | . . . . . . . . 9 ⊢ 2 ∈ ℝ* |
17 | pnfge 11964 | . . . . . . . . 9 ⊢ (2 ∈ ℝ* → 2 ≤ +∞) | |
18 | 16, 17 | ax-mp 5 | . . . . . . . 8 ⊢ 2 ≤ +∞ |
19 | breq2 4657 | . . . . . . . 8 ⊢ ((#‘𝑃) = +∞ → (2 ≤ (#‘𝑃) ↔ 2 ≤ +∞)) | |
20 | 18, 19 | mpbiri 248 | . . . . . . 7 ⊢ ((#‘𝑃) = +∞ → 2 ≤ (#‘𝑃)) |
21 | 20 | adantl 482 | . . . . . 6 ⊢ ((1 < (#‘𝑃) ∧ (#‘𝑃) = +∞) → 2 ≤ (#‘𝑃)) |
22 | hashnn0pnf 13130 | . . . . . . 7 ⊢ (𝑃 ∈ V → ((#‘𝑃) ∈ ℕ0 ∨ (#‘𝑃) = +∞)) | |
23 | 3, 22 | mp1i 13 | . . . . . 6 ⊢ (1 < (#‘𝑃) → ((#‘𝑃) ∈ ℕ0 ∨ (#‘𝑃) = +∞)) |
24 | 14, 21, 23 | mpjaodan 827 | . . . . 5 ⊢ (1 < (#‘𝑃) → 2 ≤ (#‘𝑃)) |
25 | 24 | orim2i 540 | . . . 4 ⊢ (((#‘𝑃) = 1 ∨ 1 < (#‘𝑃)) → ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))) |
26 | 25 | orim2i 540 | . . 3 ⊢ (((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 1 < (#‘𝑃))) → ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)))) |
27 | 7, 26 | mp1i 13 | . 2 ⊢ (𝜑 → ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)))) |
28 | tgldimor.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
29 | ne0i 3921 | . . . 4 ⊢ (𝐴 ∈ 𝑃 → 𝑃 ≠ ∅) | |
30 | hasheq0 13154 | . . . . . . 7 ⊢ (𝑃 ∈ V → ((#‘𝑃) = 0 ↔ 𝑃 = ∅)) | |
31 | 3, 30 | ax-mp 5 | . . . . . 6 ⊢ ((#‘𝑃) = 0 ↔ 𝑃 = ∅) |
32 | 31 | biimpi 206 | . . . . 5 ⊢ ((#‘𝑃) = 0 → 𝑃 = ∅) |
33 | 32 | necon3ai 2819 | . . . 4 ⊢ (𝑃 ≠ ∅ → ¬ (#‘𝑃) = 0) |
34 | 28, 29, 33 | 3syl 18 | . . 3 ⊢ (𝜑 → ¬ (#‘𝑃) = 0) |
35 | biorf 420 | . . 3 ⊢ (¬ (#‘𝑃) = 0 → (((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)) ↔ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))))) | |
36 | 34, 35 | syl 17 | . 2 ⊢ (𝜑 → (((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃)) ↔ ((#‘𝑃) = 0 ∨ ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))))) |
37 | 27, 36 | mpbird 247 | 1 ⊢ (𝜑 → ((#‘𝑃) = 1 ∨ 2 ≤ (#‘𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∨ wo 383 ∧ wa 384 ∨ w3o 1036 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 Vcvv 3200 ∅c0 3915 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 0cc0 9936 1c1 9937 + caddc 9939 +∞cpnf 10071 ℝ*cxr 10073 < clt 10074 ≤ cle 10075 2c2 11070 ℕ0cn0 11292 ℤcz 11377 #chash 13117 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-fz 12327 df-hash 13118 |
This theorem is referenced by: tgifscgr 25403 tgcgrxfr 25413 tgbtwnconn3 25472 legtrid 25486 hpgerlem 25657 |
Copyright terms: Public domain | W3C validator |