| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isarchi | Structured version Visualization version GIF version | ||
| Description: Express the predicate "𝑊 is Archimedean ". (Contributed by Thierry Arnoux, 30-Jan-2018.) |
| Ref | Expression |
|---|---|
| isarchi.b | ⊢ 𝐵 = (Base‘𝑊) |
| isarchi.0 | ⊢ 0 = (0g‘𝑊) |
| isarchi.i | ⊢ < = (⋘‘𝑊) |
| Ref | Expression |
|---|---|
| isarchi | ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveqeq2 6899 | . . 3 ⊢ (𝑤 = 𝑊 → ((⋘‘𝑤) = ∅ ↔ (⋘‘𝑊) = ∅)) | |
| 2 | df-archi 33790 | . . 3 ⊢ Archi = {𝑤 ∣ (⋘‘𝑤) = ∅} | |
| 3 | 1, 2 | elab2g 3633 | . 2 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ (⋘‘𝑊) = ∅)) |
| 4 | isarchi.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
| 5 | 4 | inftmrel 33791 | . . 3 ⊢ (𝑊 ∈ 𝑉 → (⋘‘𝑊) ⊆ (𝐵 × 𝐵)) |
| 6 | ss0b 4350 | . . . . 5 ⊢ ((⋘‘𝑊) ⊆ ∅ ↔ (⋘‘𝑊) = ∅) | |
| 7 | ssrel2 5762 | . . . . 5 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) ⊆ ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅))) | |
| 8 | 6, 7 | bitr3id 288 | . . . 4 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅))) |
| 9 | noel 4282 | . . . . . . . 8 ⊢ ¬ 〈𝑥, 𝑦〉 ∈ ∅ | |
| 10 | 9 | nbn 375 | . . . . . . 7 ⊢ (¬ 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅)) |
| 11 | isarchi.i | . . . . . . . . 9 ⊢ < = (⋘‘𝑊) | |
| 12 | 11 | breqi 5108 | . . . . . . . 8 ⊢ (𝑥 < 𝑦 ↔ 𝑥(⋘‘𝑊)𝑦) |
| 13 | df-br 5103 | . . . . . . . 8 ⊢ (𝑥(⋘‘𝑊)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)) | |
| 14 | 12, 13 | bitri 278 | . . . . . . 7 ⊢ (𝑥 < 𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)) |
| 15 | 10, 14 | xchnxbir 336 | . . . . . 6 ⊢ (¬ 𝑥 < 𝑦 ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅)) |
| 16 | 9 | pm2.21i 120 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ ∅ → 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)) |
| 17 | dfbi2 480 | . . . . . . 7 ⊢ ((〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅) ↔ ((〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅) ∧ (〈𝑥, 𝑦〉 ∈ ∅ → 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)))) | |
| 18 | 16, 17 | mpbiran2 723 | . . . . . 6 ⊢ ((〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅) ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅)) |
| 19 | 15, 18 | bitri 278 | . . . . 5 ⊢ (¬ 𝑥 < 𝑦 ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅)) |
| 20 | 19 | 2ralbii 3137 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅)) |
| 21 | 8, 20 | bitr4di 292 | . . 3 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| 22 | 5, 21 | syl 18 | . 2 ⊢ (𝑊 ∈ 𝑉 → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| 23 | 3, 22 | bitrd 282 | 1 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ⊆ wss 3896 ∅c0 4277 〈cop 4834 class class class wbr 5102 × cxp 5649 ‘cfv 6543 Basecbs 17396 0gc0g 17619 ⋘cinftm 33787 Archicarchi 33788 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6497 df-fun 6545 df-fv 6551 df-ov 7427 df-inftm 33789 df-archi 33790 |
| This theorem is used by: xrnarchi 33795 isarchi2 33796 |
| Copyright terms: Public domain | W3C validator |