Theorem axtgcont1 28923

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.

Step	Hyp	Ref	Expression
1		df-trkg 28908	. . . . 5 ⊢ TarskiG = ((TarskiGC ∩ TarskiGB) ∩ (TarskiGCB ∩ {𝑓 ∣ [(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥 ∈ 𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})}))
2		inss1 4182	. . . . . 6 ⊢ ((TarskiGC ∩ TarskiGB) ∩ (TarskiGCB ∩ {𝑓 ∣ [(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥 ∈ 𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})})) ⊆ (TarskiGC ∩ TarskiGB)
3		inss2 4183	. . . . . 6 ⊢ (TarskiGC ∩ TarskiGB) ⊆ TarskiGB
4	2, 3	sstri 3940	. . . . 5 ⊢ ((TarskiGC ∩ TarskiGB) ∩ (TarskiGCB ∩ {𝑓 ∣ [(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥 ∈ 𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})})) ⊆ TarskiGB
5	1, 4	eqsstri 3977	. . . 4 ⊢ TarskiG ⊆ TarskiGB
6		axtrkg.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7	5, 6	sselid 3929	. . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiGB)
8		axtrkg.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
9		axtrkg.d	. . . . . 6 ⊢ − = (dist‘𝐺)
10		axtrkg.i	. . . . . 6 ⊢ 𝐼 = (Itv‘𝐺)
11	8, 9, 10	istrkgb 28910	. . . . 5 ⊢ (𝐺 ∈ TarskiGB ↔ (𝐺 ∈ V ∧ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ∀𝑢 ∈ 𝑃 ∀𝑣 ∈ 𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎 ∈ 𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃∀𝑡 ∈ 𝒫 𝑃(∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
12	11	simprbi 503	. . . 4 ⊢ (𝐺 ∈ TarskiGB → (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ∀𝑢 ∈ 𝑃 ∀𝑣 ∈ 𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎 ∈ 𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃∀𝑡 ∈ 𝒫 𝑃(∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
13	12	simp3d 1162	. . 3 ⊢ (𝐺 ∈ TarskiGB → ∀𝑠 ∈ 𝒫 𝑃∀𝑡 ∈ 𝒫 𝑃(∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
14	7, 13	syl 18	. 2 ⊢ (𝜑 → ∀𝑠 ∈ 𝒫 𝑃∀𝑡 ∈ 𝒫 𝑃(∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
15		axtgcont.1	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝑃)
16	8	fvexi 6897	. . . . . 6 ⊢ 𝑃 ∈ V
17	16	ssex 5282	. . . . 5 ⊢ (𝑆 ⊆ 𝑃 → 𝑆 ∈ V)
18		elpwg 4560	. . . . 5 ⊢ (𝑆 ∈ V → (𝑆 ∈ 𝒫 𝑃 ↔ 𝑆 ⊆ 𝑃))
19	15, 17, 18	3syl 19	. . . 4 ⊢ (𝜑 → (𝑆 ∈ 𝒫 𝑃 ↔ 𝑆 ⊆ 𝑃))
20	15, 19	mpbird 260	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝒫 𝑃)
21		axtgcont.2	. . . 4 ⊢ (𝜑 → 𝑇 ⊆ 𝑃)
22	16	ssex 5282	. . . . 5 ⊢ (𝑇 ⊆ 𝑃 → 𝑇 ∈ V)
23		elpwg 4560	. . . . 5 ⊢ (𝑇 ∈ V → (𝑇 ∈ 𝒫 𝑃 ↔ 𝑇 ⊆ 𝑃))
24	21, 22, 23	3syl 19	. . . 4 ⊢ (𝜑 → (𝑇 ∈ 𝒫 𝑃 ↔ 𝑇 ⊆ 𝑃))
25	21, 24	mpbird 260	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝒫 𝑃)
26		raleq 3317	. . . . . 6 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
27	26	rexbidv 3187	. . . . 5 ⊢ (𝑠 = 𝑆 → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
28		raleq 3317	. . . . . 6 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
29	28	rexbidv 3187	. . . . 5 ⊢ (𝑠 = 𝑆 → (∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
30	27, 29	imbi12d 347	. . . 4 ⊢ (𝑠 = 𝑆 → ((∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)) ↔ (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
31		raleq 3317	. . . . . 6 ⊢ (𝑡 = 𝑇 → (∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦)))
32	31	rexralbidv 3229	. . . . 5 ⊢ (𝑡 = 𝑇 → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) ↔ ∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦)))
33		raleq 3317	. . . . . 6 ⊢ (𝑡 = 𝑇 → (∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦)))
34	33	rexralbidv 3229	. . . . 5 ⊢ (𝑡 = 𝑇 → (∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦) ↔ ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦)))
35	32, 34	imbi12d 347	. . . 4 ⊢ (𝑡 = 𝑇 → ((∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)) ↔ (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦))))
36	30, 35	rspc2v 3587	. . 3 ⊢ ((𝑆 ∈ 𝒫 𝑃 ∧ 𝑇 ∈ 𝒫 𝑃) → (∀𝑠 ∈ 𝒫 𝑃∀𝑡 ∈ 𝒫 𝑃(∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)) → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦))))
37	20, 25, 36	syl2anc 596	. 2 ⊢ (𝜑 → (∀𝑠 ∈ 𝒫 𝑃∀𝑡 ∈ 𝒫 𝑃(∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑡 𝑏 ∈ (𝑥𝐼𝑦)) → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦))))
38	14, 37	mpd 16	1 ⊢ (𝜑 → (∃𝑎 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏 ∈ 𝑃 ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 𝑏 ∈ (𝑥𝐼𝑦)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451  [wsbc 3739   ∖ cdif 3896   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  Basecbs 17380  distcds 17430  TarskiGcstrkg 28882  TarskiG_Ccstrkgc 28883  TarskiG_Bcstrkgb 28884  TarskiG_CBcstrkgcb 28885  Itvcitv 28888  LineGclng 28889

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-nul 5260

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6493  df-fv 6545  df-ov 7421  df-trkgb 28904  df-trkg 28908

This theorem is used by:  axtgcont  28924