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

Theorem ntrneix3 40656
 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 3941 . . . . . 6 ((𝐼‘(𝑠𝑡)) ⊆ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥 ∈ (𝐼‘(𝑠𝑡))𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)))
2 ntrnei.o . . . . . . . . . . . . 13 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗m 𝑖) ↦ (𝑙𝑗 ↦ {𝑚𝑖𝑙 ∈ (𝑘𝑚)})))
3 ntrnei.f . . . . . . . . . . . . 13 𝐹 = (𝒫 𝐵𝑂𝐵)
4 ntrnei.r . . . . . . . . . . . . 13 (𝜑𝐼𝐹𝑁)
52, 3, 4ntrneiiex 40635 . . . . . . . . . . . 12 (𝜑𝐼 ∈ (𝒫 𝐵m 𝒫 𝐵))
65ad2antrr 725 . . . . . . . . . . 11 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐼 ∈ (𝒫 𝐵m 𝒫 𝐵))
7 elmapi 8418 . . . . . . . . . . 11 (𝐼 ∈ (𝒫 𝐵m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
86, 7syl 17 . . . . . . . . . 10 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵)
92, 3, 4ntrneibex 40632 . . . . . . . . . . . 12 (𝜑𝐵 ∈ V)
109ad2antrr 725 . . . . . . . . . . 11 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝐵 ∈ V)
11 simplr 768 . . . . . . . . . . . . 13 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑠 ∈ 𝒫 𝐵)
1211elpwid 4532 . . . . . . . . . . . 12 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑠𝐵)
13 simpr 488 . . . . . . . . . . . . 13 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡 ∈ 𝒫 𝐵)
1413elpwid 4532 . . . . . . . . . . . 12 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → 𝑡𝐵)
1512, 14unssd 4147 . . . . . . . . . . 11 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠𝑡) ⊆ 𝐵)
1610, 15sselpwd 5216 . . . . . . . . . 10 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝑠𝑡) ∈ 𝒫 𝐵)
178, 16ffvelrnd 6840 . . . . . . . . 9 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠𝑡)) ∈ 𝒫 𝐵)
1817elpwid 4532 . . . . . . . 8 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (𝐼‘(𝑠𝑡)) ⊆ 𝐵)
19 ralss 4022 . . . . . . . 8 ((𝐼‘(𝑠𝑡)) ⊆ 𝐵 → (∀𝑥 ∈ (𝐼‘(𝑠𝑡))𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥𝐵 (𝑥 ∈ (𝐼‘(𝑠𝑡)) → 𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)))))
2018, 19syl 17 . . . . . . 7 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ (𝐼‘(𝑠𝑡))𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥𝐵 (𝑥 ∈ (𝐼‘(𝑠𝑡)) → 𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)))))
214ad3antrrr 729 . . . . . . . . . 10 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝐼𝐹𝑁)
22 simpr 488 . . . . . . . . . 10 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑥𝐵)
239ad3antrrr 729 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝐵 ∈ V)
24 simpllr 775 . . . . . . . . . . . . 13 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑠 ∈ 𝒫 𝐵)
2524elpwid 4532 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑠𝐵)
26 simplr 768 . . . . . . . . . . . . 13 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑡 ∈ 𝒫 𝐵)
2726elpwid 4532 . . . . . . . . . . . 12 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → 𝑡𝐵)
2825, 27unssd 4147 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑠𝑡) ⊆ 𝐵)
2923, 28sselpwd 5216 . . . . . . . . . 10 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑠𝑡) ∈ 𝒫 𝐵)
302, 3, 21, 22, 29ntrneiel 40640 . . . . . . . . 9 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ (𝐼‘(𝑠𝑡)) ↔ (𝑠𝑡) ∈ (𝑁𝑥)))
31 elun 4110 . . . . . . . . . 10 (𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ (𝑥 ∈ (𝐼𝑠) ∨ 𝑥 ∈ (𝐼𝑡)))
322, 3, 21, 22, 24ntrneiel 40640 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ (𝐼𝑠) ↔ 𝑠 ∈ (𝑁𝑥)))
332, 3, 21, 22, 26ntrneiel 40640 . . . . . . . . . . 11 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ (𝐼𝑡) ↔ 𝑡 ∈ (𝑁𝑥)))
3432, 33orbi12d 916 . . . . . . . . . 10 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → ((𝑥 ∈ (𝐼𝑠) ∨ 𝑥 ∈ (𝐼𝑡)) ↔ (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥))))
3531, 34syl5bb 286 . . . . . . . . 9 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → (𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥))))
3630, 35imbi12d 348 . . . . . . . 8 ((((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) ∧ 𝑥𝐵) → ((𝑥 ∈ (𝐼‘(𝑠𝑡)) → 𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡))) ↔ ((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
3736ralbidva 3191 . . . . . . 7 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥𝐵 (𝑥 ∈ (𝐼‘(𝑠𝑡)) → 𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡))) ↔ ∀𝑥𝐵 ((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
3820, 37bitrd 282 . . . . . 6 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → (∀𝑥 ∈ (𝐼‘(𝑠𝑡))𝑥 ∈ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥𝐵 ((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
391, 38syl5bb 286 . . . . 5 (((𝜑𝑠 ∈ 𝒫 𝐵) ∧ 𝑡 ∈ 𝒫 𝐵) → ((𝐼‘(𝑠𝑡)) ⊆ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥𝐵 ((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
4039ralbidva 3191 . . . 4 ((𝜑𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠𝑡)) ⊆ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑡 ∈ 𝒫 𝐵𝑥𝐵 ((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
41 ralcom 3346 . . . 4 (∀𝑡 ∈ 𝒫 𝐵𝑥𝐵 ((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥))) ↔ ∀𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥))))
4240, 41syl6bb 290 . . 3 ((𝜑𝑠 ∈ 𝒫 𝐵) → (∀𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠𝑡)) ⊆ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
4342ralbidva 3191 . 2 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠𝑡)) ⊆ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑠 ∈ 𝒫 𝐵𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
44 ralcom 3346 . 2 (∀𝑠 ∈ 𝒫 𝐵𝑥𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥))) ↔ ∀𝑥𝐵𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥))))
4543, 44syl6bb 290 1 (𝜑 → (∀𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵(𝐼‘(𝑠𝑡)) ⊆ ((𝐼𝑠) ∪ (𝐼𝑡)) ↔ ∀𝑥𝐵𝑠 ∈ 𝒫 𝐵𝑡 ∈ 𝒫 𝐵((𝑠𝑡) ∈ (𝑁𝑥) → (𝑠 ∈ (𝑁𝑥) ∨ 𝑡 ∈ (𝑁𝑥)))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2115  ∀wral 3133  {crab 3137  Vcvv 3480   ∪ cun 3917   ⊆ wss 3919  𝒫 cpw 4521   class class class wbr 5052   ↦ cmpt 5132  ⟶wf 6339  ‘cfv 6343  (class class class)co 7145   ∈ cmpo 7147   ↑m cmap 8396 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5176  ax-sep 5189  ax-nul 5196  ax-pow 5253  ax-pr 5317  ax-un 7451 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3482  df-sbc 3759  df-csb 3867  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4276  df-if 4450  df-pw 4523  df-sn 4550  df-pr 4552  df-op 4556  df-uni 4825  df-iun 4907  df-br 5053  df-opab 5115  df-mpt 5133  df-id 5447  df-xp 5548  df-rel 5549  df-cnv 5550  df-co 5551  df-dm 5552  df-rn 5553  df-res 5554  df-ima 5555  df-iota 6302  df-fun 6345  df-fn 6346  df-f 6347  df-f1 6348  df-fo 6349  df-f1o 6350  df-fv 6351  df-ov 7148  df-oprab 7149  df-mpo 7150  df-1st 7679  df-2nd 7680  df-map 8398 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator