Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ntrneix3 Structured version   Visualization version   GIF version

Theorem ntrneix3 45418
Description: The closure of the union of any pair is a subset of the union of closures if and only if the union of any pair belonging to the convergents of a point implies at least one of the pair belongs to the the convergents of that point. (Contributed by RP, 19-Jun-2021.)
Hypotheses
Ref Expression
ntrnei.o 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
ntrnei.f 𝐹 = (𝒫 𝐵𝑂𝐵)
ntrnei.r (𝜑 → 𝐼𝐹𝑁)
Assertion
Ref Expression
ntrneix3 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
Distinct variable groups:   𝐵,𝑖,𝑗,𝑘,𝑙,𝑚,𝑠,𝑡,𝑥   𝑘,𝐼,𝑙,𝑚,𝑥   𝜑,𝑖,𝑗,𝑘,𝑙,𝑠,𝑡,𝑥
Allowed substitution hints:   𝜑(𝑚)   𝐹(𝑥, 𝑡, 𝑖, 𝑗, 𝑘, 𝑚, 𝑠, 𝑙)   𝐼(𝑡, 𝑖, 𝑗, 𝑠)   𝑁(𝑥, 𝑡, 𝑖, 𝑗, 𝑘, 𝑚, 𝑠, 𝑙)   𝑂(𝑥, 𝑡, 𝑖, 𝑗, 𝑘, 𝑚, 𝑠, 𝑙)

Proof of Theorem ntrneix3
StepHypRef Expression
1 dfss3 3901 . . . . . 6 ((𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)))
2 ntrnei.o . . . . . . . . . . . . 13 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)})))
3 ntrnei.f . . . . . . . . . . . . 13 𝐹 = (𝒫 𝐵𝑂𝐵)
4 ntrnei.r . . . . . . . . . . . . 13 (𝜑 → 𝐼𝐹𝑁)
52, 3, 4ntrneiiex 45397 . . . . . . . . . . . 12 (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
65ad2antrr 739 . . . . . . . . . . 11 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵))
7 elmapi 8906 . . . . . . . . . . 11 (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
86, 7syl 18 . . . . . . . . . 10 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
92, 3, 4ntrneibex 45394 . . . . . . . . . . . 12 (𝜑 → 𝐵 ∈ V)
109ad2antrr 739 . . . . . . . . . . 11 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐵 ∈ V)
11 simplr 781 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
1211elpwid 4568 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑠 ⊆ 𝐵)
13 simpr 490 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡 ∈ 𝒫 𝐵)
1413elpwid 4568 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡 ⊆ 𝐵)
1512, 14unssd 4192 . . . . . . . . . . 11 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠 ∪ 𝑡) ⊆ 𝐵)
1610, 15sselpwd 5296 . . . . . . . . . 10 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠 ∪ 𝑡) ∈ 𝒫 𝐵)
178, 16ffvelcdmd 7116 . . . . . . . . 9 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠 ∪ 𝑡)) ∈ 𝒫 𝐵)
1817elpwid 4568 . . . . . . . 8 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠 ∪ 𝑡)) ⊆ 𝐵)
19 ralss 3985 . . . . . . . 8 ((𝐼‘(𝑠 ∪ 𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)))))
2018, 19syl 18 . . . . . . 7 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)))))
214ad3antrrr 743 . . . . . . . . . 10 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐼𝐹𝑁)
22 simpr 490 . . . . . . . . . 10 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
239ad3antrrr 743 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ V)
24 simpllr 788 . . . . . . . . . . . . 13 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑠 ∈ 𝒫 𝐵)
2524elpwid 4568 . . . . . . . . . . . 12 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑠 ⊆ 𝐵)
26 simplr 781 . . . . . . . . . . . . 13 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑡 ∈ 𝒫 𝐵)
2726elpwid 4568 . . . . . . . . . . . 12 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑡 ⊆ 𝐵)
2825, 27unssd 4192 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑠 ∪ 𝑡) ⊆ 𝐵)
2923, 28sselpwd 5296 . . . . . . . . . 10 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑠 ∪ 𝑡) ∈ 𝒫 𝐵)
302, 3, 21, 22, 29ntrneiel 45402 . . . . . . . . 9 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡)) ↔ (𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥)))
31 elun 4154 . . . . . . . . . 10 (𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ (𝑥 ∈ (𝐼‘𝑠) ∨ 𝑥 ∈ (𝐼‘𝑡)))
322, 3, 21, 22, 24ntrneiel 45402 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑠) ↔ 𝑠 ∈ (𝑁‘𝑥)))
332, 3, 21, 22, 26ntrneiel 45402 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘𝑡) ↔ 𝑡 ∈ (𝑁‘𝑥)))
3432, 33orbi12d 932 . . . . . . . . . 10 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ∈ (𝐼‘𝑠) ∨ 𝑥 ∈ (𝐼‘𝑡)) ↔ (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥))))
3531, 34bitrid 286 . . . . . . . . 9 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥))))
3630, 35imbi12d 347 . . . . . . . 8 ((((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡))) ↔ ((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
3736ralbidva 3190 . . . . . . 7 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡)) → 𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡))) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
3820, 37bitrd 282 . . . . . 6 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ (𝐼‘(𝑠 ∪ 𝑡))𝑥 ∈ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
391, 38bitrid 286 . . . . 5 (((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
4039ralbidva 3190 . . . 4 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑡 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
41 ralcom 3294 . . . 4 (∀𝑡 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥))))
4240, 41bitrdi 290 . . 3 ((𝜑 ∧ 𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
4342ralbidva 3190 . 2 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑠 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
44 ralcom 3294 . 2 (∀𝑠 ∈ 𝒫 𝐵∀𝑥 ∈ 𝐵 ∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥))) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥))))
4543, 44bitrdi 290 1 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠 ∪ 𝑡)) ⊆ ((𝐼‘𝑠) ∪ (𝐼‘𝑡)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑠 ∈ 𝒫 𝐵∀𝑡 ∈ 𝒫 𝐵((𝑠 ∪ 𝑡) ∈ (𝑁‘𝑥) → (𝑠 ∈ (𝑁‘𝑥) ∨ 𝑡 ∈ (𝑁‘𝑥)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1572   ∈ wcel 2150  ∀wral 3083  {crab 3415  Vcvv 3453   ⊆ wss 3899   ∪ cun 4151  𝒫 cpw 4559   class class class wbr 5107   ↦ cmpt 5191  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452   ↑m cmap 8884
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-map 8886
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator