MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axtgcont1 Structured version   Visualization version   GIF version

Theorem axtgcont1 25936
Description: Axiom of Continuity. Axiom A11 of [Schwabhauser] p. 13. This axiom (scheme) asserts that any two sets 𝑆 and 𝑇 (of points) such that the elements of 𝑆 precede the elements of 𝑇 with respect to some point 𝑎 (that is, 𝑥 is between 𝑎 and 𝑦 whenever 𝑥 is in 𝑋 and 𝑦 is in 𝑌) are separated by some point 𝑏; this is explained in Axiom 11 of [Tarski1999] p. 185. (Contributed by Thierry Arnoux, 16-Mar-2019.)
Hypotheses
Ref Expression
axtrkg.p 𝑃 = (Base‘𝐺)
axtrkg.d = (dist‘𝐺)
axtrkg.i 𝐼 = (Itv‘𝐺)
axtrkg.g (𝜑𝐺 ∈ TarskiG)
axtgcont.1 (𝜑𝑆𝑃)
axtgcont.2 (𝜑𝑇𝑃)
Assertion
Ref Expression
axtgcont1 (𝜑 → (∃𝑎𝑃𝑥𝑆𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦)))
Distinct variable groups:   𝑥,𝑦   𝑎,𝑏,𝑥,𝑦,𝐼   𝑃,𝑎,𝑏,𝑥,𝑦   𝑆,𝑎,𝑏,𝑥   𝑇,𝑎,𝑏,𝑥,𝑦   ,𝑎,𝑏,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑎,𝑏)   𝑆(𝑦)   𝐺(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem axtgcont1
Dummy variables 𝑓 𝑖 𝑝 𝑧 𝑣 𝑠 𝑡 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-trkg 25921 . . . . 5 TarskiG = ((TarskiGC ∩ TarskiGB) ∩ (TarskiGCB ∩ {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})}))
2 inss1 4127 . . . . . 6 ((TarskiGC ∩ TarskiGB) ∩ (TarskiGCB ∩ {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})})) ⊆ (TarskiGC ∩ TarskiGB)
3 inss2 4128 . . . . . 6 (TarskiGC ∩ TarskiGB) ⊆ TarskiGB
42, 3sstri 3900 . . . . 5 ((TarskiGC ∩ TarskiGB) ∩ (TarskiGCB ∩ {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})})) ⊆ TarskiGB
51, 4eqsstri 3924 . . . 4 TarskiG ⊆ TarskiGB
6 axtrkg.g . . . 4 (𝜑𝐺 ∈ TarskiG)
75, 6sseldi 3889 . . 3 (𝜑𝐺 ∈ TarskiGB)
8 axtrkg.p . . . . . 6 𝑃 = (Base‘𝐺)
9 axtrkg.d . . . . . 6 = (dist‘𝐺)
10 axtrkg.i . . . . . 6 𝐼 = (Itv‘𝐺)
118, 9, 10istrkgb 25923 . . . . 5 (𝐺 ∈ TarskiGB ↔ (𝐺 ∈ V ∧ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
1211simprbi 497 . . . 4 (𝐺 ∈ TarskiGB → (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
1312simp3d 1137 . . 3 (𝐺 ∈ TarskiGB → ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
147, 13syl 17 . 2 (𝜑 → ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
15 axtgcont.1 . . . 4 (𝜑𝑆𝑃)
168fvexi 6555 . . . . . 6 𝑃 ∈ V
1716ssex 5119 . . . . 5 (𝑆𝑃𝑆 ∈ V)
18 elpwg 4463 . . . . 5 (𝑆 ∈ V → (𝑆 ∈ 𝒫 𝑃𝑆𝑃))
1915, 17, 183syl 18 . . . 4 (𝜑 → (𝑆 ∈ 𝒫 𝑃𝑆𝑃))
2015, 19mpbird 258 . . 3 (𝜑𝑆 ∈ 𝒫 𝑃)
21 axtgcont.2 . . . 4 (𝜑𝑇𝑃)
2216ssex 5119 . . . . 5 (𝑇𝑃𝑇 ∈ V)
23 elpwg 4463 . . . . 5 (𝑇 ∈ V → (𝑇 ∈ 𝒫 𝑃𝑇𝑃))
2421, 22, 233syl 18 . . . 4 (𝜑 → (𝑇 ∈ 𝒫 𝑃𝑇𝑃))
2521, 24mpbird 258 . . 3 (𝜑𝑇 ∈ 𝒫 𝑃)
26 raleq 3364 . . . . . 6 (𝑠 = 𝑆 → (∀𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑥𝑆𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
2726rexbidv 3259 . . . . 5 (𝑠 = 𝑆 → (∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∃𝑎𝑃𝑥𝑆𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
28 raleq 3364 . . . . . 6 (𝑠 = 𝑆 → (∀𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∀𝑥𝑆𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
2928rexbidv 3259 . . . . 5 (𝑠 = 𝑆 → (∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∃𝑏𝑃𝑥𝑆𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
3027, 29imbi12d 346 . . . 4 (𝑠 = 𝑆 → ((∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)) ↔ (∃𝑎𝑃𝑥𝑆𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
31 raleq 3364 . . . . . 6 (𝑡 = 𝑇 → (∀𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦)))
3231rexralbidv 3263 . . . . 5 (𝑡 = 𝑇 → (∃𝑎𝑃𝑥𝑆𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∃𝑎𝑃𝑥𝑆𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦)))
33 raleq 3364 . . . . . 6 (𝑡 = 𝑇 → (∀𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∀𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦)))
3433rexralbidv 3263 . . . . 5 (𝑡 = 𝑇 → (∃𝑏𝑃𝑥𝑆𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∃𝑏𝑃𝑥𝑆𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦)))
3532, 34imbi12d 346 . . . 4 (𝑡 = 𝑇 → ((∃𝑎𝑃𝑥𝑆𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)) ↔ (∃𝑎𝑃𝑥𝑆𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦))))
3630, 35rspc2v 3570 . . 3 ((𝑆 ∈ 𝒫 𝑃𝑇 ∈ 𝒫 𝑃) → (∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)) → (∃𝑎𝑃𝑥𝑆𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦))))
3720, 25, 36syl2anc 584 . 2 (𝜑 → (∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)) → (∃𝑎𝑃𝑥𝑆𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦))))
3814, 37mpd 15 1 (𝜑 → (∃𝑎𝑃𝑥𝑆𝑦𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑆𝑦𝑇 𝑏 ∈ (𝑥𝐼𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3o 1079  w3a 1080   = wceq 1522  wcel 2080  {cab 2774  wral 3104  wrex 3105  {crab 3108  Vcvv 3436  [wsbc 3707  cdif 3858  cin 3860  wss 3861  𝒫 cpw 4455  {csn 4474  cfv 6228  (class class class)co 7019  cmpo 7021  Basecbs 16312  distcds 16403  TarskiGcstrkg 25898  TarskiGCcstrkgc 25899  TarskiGBcstrkgb 25900  TarskiGCBcstrkgcb 25901  Itvcitv 25904  LineGclng 25905
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1778  ax-4 1792  ax-5 1889  ax-6 1948  ax-7 1993  ax-8 2082  ax-9 2090  ax-10 2111  ax-11 2125  ax-12 2140  ax-ext 2768  ax-sep 5097  ax-nul 5104
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1525  df-ex 1763  df-nf 1767  df-sb 2042  df-mo 2575  df-eu 2611  df-clab 2775  df-cleq 2787  df-clel 2862  df-nfc 2934  df-ral 3109  df-rex 3110  df-rab 3113  df-v 3438  df-sbc 3708  df-dif 3864  df-un 3866  df-in 3868  df-ss 3876  df-nul 4214  df-if 4384  df-pw 4457  df-sn 4475  df-pr 4477  df-op 4481  df-uni 4748  df-br 4965  df-iota 6192  df-fv 6236  df-ov 7022  df-trkgb 25917  df-trkg 25921
This theorem is referenced by:  axtgcont  25937
  Copyright terms: Public domain W3C validator