Theorem tglnunirn 26332

Description: Lines are sets of points. (Contributed by Thierry Arnoux, 25-May-2019.)

Hypotheses

Ref	Expression
tglng.p	⊢ 𝑃 = (Base‘𝐺)
tglng.l	⊢ 𝐿 = (LineG‘𝐺)
tglng.i	⊢ 𝐼 = (Itv‘𝐺)

Assertion

Ref	Expression
tglnunirn	⊢ (𝐺 ∈ TarskiG → ∪ ran 𝐿 ⊆ 𝑃)

Proof of Theorem tglnunirn

Dummy variables 𝑝 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tglng.p	. . . . . . . 8 ⊢ 𝑃 = (Base‘𝐺)
2		tglng.l	. . . . . . . 8 ⊢ 𝐿 = (LineG‘𝐺)
3		tglng.i	. . . . . . . 8 ⊢ 𝐼 = (Itv‘𝐺)
4	1, 2, 3	tglng 26330	. . . . . . 7 ⊢ (𝐺 ∈ TarskiG → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
5	4	rneqd 5801	. . . . . 6 ⊢ (𝐺 ∈ TarskiG → ran 𝐿 = ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
6	5	eleq2d 2897	. . . . 5 ⊢ (𝐺 ∈ TarskiG → (𝑝 ∈ ran 𝐿 ↔ 𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
7	6	biimpa 479	. . . 4 ⊢ ((𝐺 ∈ TarskiG ∧ 𝑝 ∈ ran 𝐿) → 𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
8		eqid 2820	. . . . . 6 ⊢ (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
9	1	fvexi 6677	. . . . . . 7 ⊢ 𝑃 ∈ V
10	9	rabex 5228	. . . . . 6 ⊢ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∈ V
11	8, 10	elrnmpo 7280	. . . . 5 ⊢ (𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ (𝑃 ∖ {𝑥})𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
12		ssrab2 4049	. . . . . . . 8 ⊢ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ⊆ 𝑃
13		sseq1 3985	. . . . . . . 8 ⊢ (𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → (𝑝 ⊆ 𝑃 ↔ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ⊆ 𝑃))
14	12, 13	mpbiri 260	. . . . . . 7 ⊢ (𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → 𝑝 ⊆ 𝑃)
15	14	rexlimivw 3281	. . . . . 6 ⊢ (∃𝑦 ∈ (𝑃 ∖ {𝑥})𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → 𝑝 ⊆ 𝑃)
16	15	rexlimivw 3281	. . . . 5 ⊢ (∃𝑥 ∈ 𝑃 ∃𝑦 ∈ (𝑃 ∖ {𝑥})𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → 𝑝 ⊆ 𝑃)
17	11, 16	sylbi 219	. . . 4 ⊢ (𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝑝 ⊆ 𝑃)
18	7, 17	syl 17	. . 3 ⊢ ((𝐺 ∈ TarskiG ∧ 𝑝 ∈ ran 𝐿) → 𝑝 ⊆ 𝑃)
19	18	ralrimiva 3181	. 2 ⊢ (𝐺 ∈ TarskiG → ∀𝑝 ∈ ran 𝐿 𝑝 ⊆ 𝑃)
20		unissb 4863	. 2 ⊢ (∪ ran 𝐿 ⊆ 𝑃 ↔ ∀𝑝 ∈ ran 𝐿 𝑝 ⊆ 𝑃)
21	19, 20	sylibr 236	1 ⊢ (𝐺 ∈ TarskiG → ∪ ran 𝐿 ⊆ 𝑃)

Syntax hints:   → wi 4   ∧ wa 398   ∨ w3o 1081   = wceq 1536   ∈ wcel 2113  ∀wral 3137  ∃wrex 3138  {crab 3141   ∖ cdif 3926   ⊆ wss 3929  {csn 4560  ∪ cuni 4831  ran crn 5549  ‘cfv 6348  (class class class)co 7149   ∈ cmpo 7151  Basecbs 16478  TarskiGcstrkg 26214  Itvcitv 26220  LineGclng 26221

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5060  df-opab 5122  df-cnv 5556  df-dm 5558  df-rn 5559  df-iota 6307  df-fv 6356  df-ov 7152  df-oprab 7153  df-mpo 7154  df-trkg 26237

This theorem is referenced by:  tglnpt  26333  tglineintmo  26426