ixxssixx - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > ixxssixx		GIF version

Theorem ixxssixx 10094

Description: An interval is a subset of its closure. (Contributed by Paul Chapman, 18-Oct-2007.) (Revised by Mario Carneiro, 3-Nov-2013.)

**Hypotheses**
Ref	Expression
ixxssixx.1	⊢ 𝑂 = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)})
ixx.2	⊢ 𝑃 = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥𝑇𝑧 ∧ 𝑧𝑈𝑦)})
ixx.3	⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴𝑅𝑤 → 𝐴𝑇𝑤))
ixx.4	⊢ ((𝑤 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝑤𝑆𝐵 → 𝑤𝑈𝐵))

**Assertion**
Ref	Expression
ixxssixx	⊢ (𝐴𝑂𝐵) ⊆ (𝐴𝑃𝐵)

Distinct variable groups: 𝑥,𝑤,𝑦,𝑧,𝐴 𝑤,𝑂,𝑥 𝑤,𝐵,𝑥,𝑦,𝑧 𝑤,𝑃 𝑥,𝑅,𝑦,𝑧 𝑥,𝑆,𝑦,𝑧 𝑥,𝑇,𝑦,𝑧 𝑥,𝑈,𝑦,𝑧 Allowed substitution hints: 𝑃(𝑥,𝑦,𝑧) 𝑅(𝑤) 𝑆(𝑤) 𝑇(𝑤) 𝑈(𝑤) 𝑂(𝑦,𝑧)

**Proof of Theorem ixxssixx**
Step	Hyp	Ref	Expression
1		ixxssixx.1	. . . 4 ⊢ 𝑂 = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)})
2	1	elmpocl 6199	. . 3 ⊢ (𝑤 ∈ (𝐴𝑂𝐵) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
3		simp1 1021	. . . . . 6 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝑤 ∈ ℝ^*)
4	3	a1i 9	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → ((𝑤 ∈ ℝ^ ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝑤 ∈ ℝ^*))
5		simpl 109	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → 𝐴 ∈ ℝ^)
6		3simpa 1018	. . . . . 6 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → (𝑤 ∈ ℝ^* ∧ 𝐴𝑅𝑤))
7		ixx.3	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴𝑅𝑤 → 𝐴𝑇𝑤))
8	7	expimpd 363	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → ((𝑤 ∈ ℝ^* ∧ 𝐴𝑅𝑤) → 𝐴𝑇𝑤))
9	5, 6, 8	syl2im 38	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → ((𝑤 ∈ ℝ^ ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝐴𝑇𝑤))
10		simpr 110	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → 𝐵 ∈ ℝ^)
11		3simpb 1019	. . . . . 6 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → (𝑤 ∈ ℝ^* ∧ 𝑤𝑆𝐵))
12		ixx.4	. . . . . . . 8 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝑤𝑆𝐵 → 𝑤𝑈𝐵))
13	12	ancoms 268	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝑤𝑆𝐵 → 𝑤𝑈𝐵))
14	13	expimpd 363	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → ((𝑤 ∈ ℝ^* ∧ 𝑤𝑆𝐵) → 𝑤𝑈𝐵))
15	10, 11, 14	syl2im 38	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → ((𝑤 ∈ ℝ^ ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → 𝑤𝑈𝐵))
16	4, 9, 15	3jcad 1202	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → ((𝑤 ∈ ℝ^ ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵) → (𝑤 ∈ ℝ^* ∧ 𝐴𝑇𝑤 ∧ 𝑤𝑈𝐵)))
17	1	elixx1 10089	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝑤 ∈ (𝐴𝑂𝐵) ↔ (𝑤 ∈ ℝ^ ∧ 𝐴𝑅𝑤 ∧ 𝑤𝑆𝐵)))
18		ixx.2	. . . . 5 ⊢ 𝑃 = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥𝑇𝑧 ∧ 𝑧𝑈𝑦)})
19	18	elixx1 10089	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝑤 ∈ (𝐴𝑃𝐵) ↔ (𝑤 ∈ ℝ^ ∧ 𝐴𝑇𝑤 ∧ 𝑤𝑈𝐵)))
20	16, 17, 19	3imtr4d 203	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝑤 ∈ (𝐴𝑂𝐵) → 𝑤 ∈ (𝐴𝑃𝐵)))
21	2, 20	mpcom 36	. 2 ⊢ (𝑤 ∈ (𝐴𝑂𝐵) → 𝑤 ∈ (𝐴𝑃𝐵))
22	21	ssriv 3228	1 ⊢ (𝐴𝑂𝐵) ⊆ (𝐴𝑃𝐵)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 {crab 2512 ⊆ wss 3197 class class class wbr 4082 (class class class)co 6000 ∈ cmpo 6002 ℝ^*cxr 8176

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-cnex 8086 ax-resscn 8087

This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-iota 5277 df-fun 5319 df-fv 5325 df-ov 6003 df-oprab 6004 df-mpo 6005 df-pnf 8179 df-mnf 8180 df-xr 8181

This theorem is referenced by: ioossicc 10151 icossicc 10152 iocssicc 10153 ioossico 10154

W3C validator