| 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 6840 | . . 3 ⊢ (𝑤 = 𝑊 → ((⋘‘𝑤) = ∅ ↔ (⋘‘𝑊) = ∅)) | |
| 2 | df-archi 33189 | . . 3 ⊢ Archi = {𝑤 ∣ (⋘‘𝑤) = ∅} | |
| 3 | 1, 2 | elab2g 3632 | . 2 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ (⋘‘𝑊) = ∅)) |
| 4 | isarchi.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
| 5 | 4 | inftmrel 33190 | . . 3 ⊢ (𝑊 ∈ 𝑉 → (⋘‘𝑊) ⊆ (𝐵 × 𝐵)) |
| 6 | ss0b 4350 | . . . . 5 ⊢ ((⋘‘𝑊) ⊆ ∅ ↔ (⋘‘𝑊) = ∅) | |
| 7 | ssrel2 5731 | . . . . 5 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) ⊆ ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅))) | |
| 8 | 6, 7 | bitr3id 285 | . . . 4 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅))) |
| 9 | noel 4287 | . . . . . . . 8 ⊢ ¬ 〈𝑥, 𝑦〉 ∈ ∅ | |
| 10 | 9 | nbn 372 | . . . . . . 7 ⊢ (¬ 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅)) |
| 11 | isarchi.i | . . . . . . . . 9 ⊢ < = (⋘‘𝑊) | |
| 12 | 11 | breqi 5101 | . . . . . . . 8 ⊢ (𝑥 < 𝑦 ↔ 𝑥(⋘‘𝑊)𝑦) |
| 13 | df-br 5096 | . . . . . . . 8 ⊢ (𝑥(⋘‘𝑊)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)) | |
| 14 | 12, 13 | bitri 275 | . . . . . . 7 ⊢ (𝑥 < 𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)) |
| 15 | 10, 14 | xchnxbir 333 | . . . . . 6 ⊢ (¬ 𝑥 < 𝑦 ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅)) |
| 16 | 9 | pm2.21i 119 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ ∅ → 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)) |
| 17 | dfbi2 474 | . . . . . . 7 ⊢ ((〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅) ↔ ((〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅) ∧ (〈𝑥, 𝑦〉 ∈ ∅ → 〈𝑥, 𝑦〉 ∈ (⋘‘𝑊)))) | |
| 18 | 16, 17 | mpbiran2 710 | . . . . . 6 ⊢ ((〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) ↔ 〈𝑥, 𝑦〉 ∈ ∅) ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅)) |
| 19 | 15, 18 | bitri 275 | . . . . 5 ⊢ (¬ 𝑥 < 𝑦 ↔ (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅)) |
| 20 | 19 | 2ralbii 3108 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (〈𝑥, 𝑦〉 ∈ (⋘‘𝑊) → 〈𝑥, 𝑦〉 ∈ ∅)) |
| 21 | 8, 20 | bitr4di 289 | . . 3 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| 22 | 5, 21 | syl 17 | . 2 ⊢ (𝑊 ∈ 𝑉 → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| 23 | 3, 22 | bitrd 279 | 1 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 ∀wral 3048 ⊆ wss 3898 ∅c0 4282 〈cop 4583 class class class wbr 5095 × cxp 5619 ‘cfv 6489 Basecbs 17127 0gc0g 17350 ⋘cinftm 33186 Archicarchi 33187 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-iota 6445 df-fun 6491 df-fv 6497 df-ov 7358 df-inftm 33188 df-archi 33189 |
| This theorem is referenced by: xrnarchi 33194 isarchi2 33195 |
| Copyright terms: Public domain | W3C validator |