Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axtgcont | Structured version Visualization version GIF version |
Description: Axiom of Continuity. Axiom A11 of [Schwabhauser] p. 13. For more information see axtgcont1 25367. (Contributed by Thierry Arnoux, 16-Mar-2019.) |
Ref | Expression |
---|---|
axtrkg.p | ⊢ 𝑃 = (Base‘𝐺) |
axtrkg.d | ⊢ − = (dist‘𝐺) |
axtrkg.i | ⊢ 𝐼 = (Itv‘𝐺) |
axtrkg.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
axtgcont.1 | ⊢ (𝜑 → 𝑆 ⊆ 𝑃) |
axtgcont.2 | ⊢ (𝜑 → 𝑇 ⊆ 𝑃) |
axtgcont.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
axtgcont.4 | ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑇) → 𝑢 ∈ (𝐴𝐼𝑣)) |
Ref | Expression |
---|---|
axtgcont | ⊢ (𝜑 → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | axtgcont.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
2 | axtgcont.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑇) → 𝑢 ∈ (𝐴𝐼𝑣)) | |
3 | 2 | 3expb 1266 | . . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑇)) → 𝑢 ∈ (𝐴𝐼𝑣)) |
4 | 3 | ralrimivva 2971 | . . 3 ⊢ (𝜑 → ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣)) |
5 | simplr 792 | . . . . . . 7 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → 𝑥 = 𝑢) | |
6 | simpll 790 | . . . . . . . 8 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → 𝑎 = 𝐴) | |
7 | simpr 477 | . . . . . . . 8 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → 𝑦 = 𝑣) | |
8 | 6, 7 | oveq12d 6668 | . . . . . . 7 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → (𝑎𝐼𝑦) = (𝐴𝐼𝑣)) |
9 | 5, 8 | eleq12d 2695 | . . . . . 6 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → (𝑥 ∈ (𝑎𝐼𝑦) ↔ 𝑢 ∈ (𝐴𝐼𝑣))) |
10 | 9 | cbvraldva 3177 | . . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) → (∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣))) |
11 | 10 | cbvraldva 3177 | . . . 4 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣))) |
12 | 11 | rspcev 3309 | . . 3 ⊢ ((𝐴 ∈ 𝑃 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣)) → ∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦)) |
13 | 1, 4, 12 | syl2anc 693 | . 2 ⊢ (𝜑 → ∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦)) |
14 | axtrkg.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
15 | axtrkg.d | . . 3 ⊢ − = (dist‘𝐺) | |
16 | axtrkg.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
17 | axtrkg.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
18 | axtgcont.1 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑃) | |
19 | axtgcont.2 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ 𝑃) | |
20 | 14, 15, 16, 17, 18, 19 | axtgcont1 25367 | . 2 ⊢ (𝜑 → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦))) |
21 | 13, 20 | mpd 15 | 1 ⊢ (𝜑 → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ∃wrex 2913 ⊆ wss 3574 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 distcds 15950 TarskiGcstrkg 25329 Itvcitv 25335 |
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-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 df-ov 6653 df-trkgb 25348 df-trkg 25352 |
This theorem is referenced by: f1otrg 25751 |
Copyright terms: Public domain | W3C validator |