Theorem tglnunirn 28475

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 28473	. . . . . . 7 ⊢ (𝐺 ∈ TarskiG → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
5	4	rneqd 5902	. . . . . 6 ⊢ (𝐺 ∈ TarskiG → ran 𝐿 = ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
6	5	eleq2d 2814	. . . . 5 ⊢ (𝐺 ∈ TarskiG → (𝑝 ∈ ran 𝐿 ↔ 𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
7	6	biimpa 476	. . . 4 ⊢ ((𝐺 ∈ TarskiG ∧ 𝑝 ∈ ran 𝐿) → 𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
8		eqid 2729	. . . . . 6 ⊢ (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
9	1	fvexi 6872	. . . . . . 7 ⊢ 𝑃 ∈ V
10	9	rabex 5294	. . . . . 6 ⊢ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∈ V
11	8, 10	elrnmpo 7525	. . . . 5 ⊢ (𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ (𝑃 ∖ {𝑥})𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
12		ssrab2 4043	. . . . . . . 8 ⊢ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ⊆ 𝑃
13		sseq1 3972	. . . . . . . 8 ⊢ (𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → (𝑝 ⊆ 𝑃 ↔ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ⊆ 𝑃))
14	12, 13	mpbiri 258	. . . . . . 7 ⊢ (𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → 𝑝 ⊆ 𝑃)
15	14	rexlimivw 3130	. . . . . 6 ⊢ (∃𝑦 ∈ (𝑃 ∖ {𝑥})𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → 𝑝 ⊆ 𝑃)
16	15	rexlimivw 3130	. . . . 5 ⊢ (∃𝑥 ∈ 𝑃 ∃𝑦 ∈ (𝑃 ∖ {𝑥})𝑝 = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} → 𝑝 ⊆ 𝑃)
17	11, 16	sylbi 217	. . . 4 ⊢ (𝑝 ∈ ran (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝑝 ⊆ 𝑃)
18	7, 17	syl 17	. . 3 ⊢ ((𝐺 ∈ TarskiG ∧ 𝑝 ∈ ran 𝐿) → 𝑝 ⊆ 𝑃)
19	18	ralrimiva 3125	. 2 ⊢ (𝐺 ∈ TarskiG → ∀𝑝 ∈ ran 𝐿 𝑝 ⊆ 𝑃)
20		unissb 4903	. 2 ⊢ (∪ ran 𝐿 ⊆ 𝑃 ↔ ∀𝑝 ∈ ran 𝐿 𝑝 ⊆ 𝑃)
21	19, 20	sylibr 234	1 ⊢ (𝐺 ∈ TarskiG → ∪ ran 𝐿 ⊆ 𝑃)

Syntax hints:   → wi 4   ∧ wa 395   ∨ w3o 1085   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053  {crab 3405   ∖ cdif 3911   ⊆ wss 3914  {csn 4589  ∪ cuni 4871  ran crn 5639  ‘cfv 6511  (class class class)co 7387   ∈ cmpo 7389  Basecbs 17179  TarskiGcstrkg 28354  Itvcitv 28360  LineGclng 28361

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-cnv 5646  df-dm 5648  df-rn 5649  df-iota 6464  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-trkg 28380

This theorem is referenced by:  tglnpt  28476  tglineintmo  28569