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 26240. (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 1116 | . . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝑆 ∧ 𝑣 ∈ 𝑇)) → 𝑢 ∈ (𝐴𝐼𝑣)) |
4 | 3 | ralrimivva 3191 | . . 3 ⊢ (𝜑 → ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣)) |
5 | simplr 767 | . . . . . . 7 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → 𝑥 = 𝑢) | |
6 | simpll 765 | . . . . . . . 8 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → 𝑎 = 𝐴) | |
7 | simpr 487 | . . . . . . . 8 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → 𝑦 = 𝑣) | |
8 | 6, 7 | oveq12d 7160 | . . . . . . 7 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → (𝑎𝐼𝑦) = (𝐴𝐼𝑣)) |
9 | 5, 8 | eleq12d 2907 | . . . . . 6 ⊢ (((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) ∧ 𝑦 = 𝑣) → (𝑥 ∈ (𝑎𝐼𝑦) ↔ 𝑢 ∈ (𝐴𝐼𝑣))) |
10 | 9 | cbvraldva 3451 | . . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑥 = 𝑢) → (∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣))) |
11 | 10 | cbvraldva 3451 | . . . 4 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣))) |
12 | 11 | rspcev 3615 | . . 3 ⊢ ((𝐴 ∈ 𝑃 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑇 𝑢 ∈ (𝐴𝐼𝑣)) → ∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦)) |
13 | 1, 4, 12 | syl2anc 586 | . 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 26240 | . 2 ⊢ (𝜑 → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦))) |
21 | 13, 20 | mpd 15 | 1 ⊢ (𝜑 → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∃wrex 3139 ⊆ wss 3924 ‘cfv 6341 (class class class)co 7142 Basecbs 16466 distcds 16557 TarskiGcstrkg 26202 Itvcitv 26208 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5189 ax-nul 5196 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3488 df-sbc 3764 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-op 4560 df-uni 4825 df-br 5053 df-iota 6300 df-fv 6349 df-ov 7145 df-trkgb 26221 df-trkg 26225 |
This theorem is referenced by: f1otrg 26643 |
Copyright terms: Public domain | W3C validator |