Users' Mathboxes Mathbox for Rohan Ridenour < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mnuprdlem2 Structured version   Visualization version   GIF version

Theorem mnuprdlem2 45216
Description: Lemma for mnuprd 45219. (Contributed by Rohan Ridenour, 11-Aug-2023.)
Hypotheses
Ref Expression
mnuprdlem2.1 𝐹 = {{∅, {𝐴}}, {{∅}, {𝐵}}}
mnuprdlem2.4 (𝜑 → 𝐵 ∈ 𝑈)
mnuprdlem2.5 (𝜑 → ¬ 𝐴 = ∅)
mnuprdlem2.8 (𝜑 → ∀𝑖 ∈ {∅, {∅}}∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))
Assertion
Ref Expression
mnuprdlem2 (𝜑 → 𝐵 ∈ 𝑤)
Distinct variable groups:   𝑤,𝑖,𝑢   𝑢,𝐹,𝑖
Allowed substitution hints:   𝜑(𝑤, 𝑢, 𝑖)   𝐴(𝑤, 𝑢, 𝑖)   𝐵(𝑤, 𝑢, 𝑖)   𝑈(𝑤, 𝑢, 𝑖)   𝐹(𝑤)

Proof of Theorem mnuprdlem2
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 eleq1 2849 . . . . 5 (𝑖 = {∅} → (𝑖 ∈ 𝑢 ↔ {∅} ∈ 𝑢))
21anbi1d 643 . . . 4 (𝑖 = {∅} → ((𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤) ↔ ({∅} ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))
32rexbidv 3187 . . 3 (𝑖 = {∅} → (∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤) ↔ ∃𝑢 ∈ 𝐹 ({∅} ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))
4 mnuprdlem2.8 . . 3 (𝜑 → ∀𝑖 ∈ {∅, {∅}}∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))
5 snex 5397 . . . . 5 {∅} ∈ V
65prid2 4724 . . . 4 {∅} ∈ {∅, {∅}}
76a1i 11 . . 3 (𝜑 → {∅} ∈ {∅, {∅}})
83, 4, 7rspcdva 3578 . 2 (𝜑 → ∃𝑢 ∈ 𝐹 ({∅} ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))
9 simpl 488 . . . 4 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → 𝜑)
10 simprl 783 . . . . . . . 8 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → 𝑎 ∈ 𝐹)
11 simpr 490 . . . . . . . . . . 11 ((𝜑 ∧ {∅} ∈ 𝑎) → {∅} ∈ 𝑎)
12 0nep0 5319 . . . . . . . . . . . . . . 15 ∅ ≠ {∅}
1312necomi 3010 . . . . . . . . . . . . . 14 {∅} ≠ ∅
1413a1i 11 . . . . . . . . . . . . 13 (𝜑 → {∅} ≠ ∅)
15 mnuprdlem2.5 . . . . . . . . . . . . . . 15 (𝜑 → ¬ 𝐴 = ∅)
16 0ex 5261 . . . . . . . . . . . . . . . . 17 ∅ ∈ V
1716sneqr 4800 . . . . . . . . . . . . . . . 16 ({∅} = {𝐴} → ∅ = 𝐴)
1817eqcomd 2767 . . . . . . . . . . . . . . 15 ({∅} = {𝐴} → 𝐴 = ∅)
1915, 18nsyl 141 . . . . . . . . . . . . . 14 (𝜑 → ¬ {∅} = {𝐴})
2019neqned 2963 . . . . . . . . . . . . 13 (𝜑 → {∅} ≠ {𝐴})
2114, 20nelprd 4618 . . . . . . . . . . . 12 (𝜑 → ¬ {∅} ∈ {∅, {𝐴}})
2221adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ {∅} ∈ 𝑎) → ¬ {∅} ∈ {∅, {𝐴}})
2311, 22elnelneqd 3055 . . . . . . . . . 10 ((𝜑 ∧ {∅} ∈ 𝑎) → ¬ 𝑎 = {∅, {𝐴}})
2423adantrr 730 . . . . . . . . 9 ((𝜑 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤)) → ¬ 𝑎 = {∅, {𝐴}})
2524adantrl 729 . . . . . . . 8 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → ¬ 𝑎 = {∅, {𝐴}})
26 elpri 4608 . . . . . . . . . 10 (𝑎 ∈ {{∅, {𝐴}}, {{∅}, {𝐵}}} → (𝑎 = {∅, {𝐴}} ∨ 𝑎 = {{∅}, {𝐵}}))
27 mnuprdlem2.1 . . . . . . . . . 10 𝐹 = {{∅, {𝐴}}, {{∅}, {𝐵}}}
2826, 27eleq2s 2879 . . . . . . . . 9 (𝑎 ∈ 𝐹 → (𝑎 = {∅, {𝐴}} ∨ 𝑎 = {{∅}, {𝐵}}))
2928ord 878 . . . . . . . 8 (𝑎 ∈ 𝐹 → (¬ 𝑎 = {∅, {𝐴}} → 𝑎 = {{∅}, {𝐵}}))
3010, 25, 29sylc 66 . . . . . . 7 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → 𝑎 = {{∅}, {𝐵}})
3130unieqd 4880 . . . . . 6 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → ∪ 𝑎 = ∪ {{∅}, {𝐵}})
32 snex 5397 . . . . . . . 8 {𝐵} ∈ V
335, 32unipr 4884 . . . . . . 7 ∪ {{∅}, {𝐵}} = ({∅} ∪ {𝐵})
34 df-pr 4587 . . . . . . 7 {∅, 𝐵} = ({∅} ∪ {𝐵})
3533, 34eqtr4i 2787 . . . . . 6 ∪ {{∅}, {𝐵}} = {∅, 𝐵}
3631, 35eqtrdi 2812 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → ∪ 𝑎 = {∅, 𝐵})
37 simprrr 794 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → ∪ 𝑎 ⊆ 𝑤)
3836, 37eqsstrrd 3966 . . . 4 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → {∅, 𝐵} ⊆ 𝑤)
39 mnuprdlem2.4 . . . . . 6 (𝜑 → 𝐵 ∈ 𝑈)
40 prssg 4780 . . . . . 6 ((∅ ∈ V ∧ 𝐵 ∈ 𝑈) → ((∅ ∈ 𝑤 ∧ 𝐵 ∈ 𝑤) ↔ {∅, 𝐵} ⊆ 𝑤))
4116, 39, 40sylancr 599 . . . . 5 (𝜑 → ((∅ ∈ 𝑤 ∧ 𝐵 ∈ 𝑤) ↔ {∅, 𝐵} ⊆ 𝑤))
4241biimprd 251 . . . 4 (𝜑 → ({∅, 𝐵} ⊆ 𝑤 → (∅ ∈ 𝑤 ∧ 𝐵 ∈ 𝑤)))
439, 38, 42sylc 66 . . 3 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → (∅ ∈ 𝑤 ∧ 𝐵 ∈ 𝑤))
4443simprd 501 . 2 ((𝜑 ∧ (𝑎 ∈ 𝐹 ∧ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤))) → 𝐵 ∈ 𝑤)
45 eleq2w 2845 . . 3 (𝑢 = 𝑎 → ({∅} ∈ 𝑢 ↔ {∅} ∈ 𝑎))
46 unieq 4878 . . . 4 (𝑢 = 𝑎 → ∪ 𝑢 = ∪ 𝑎)
4746sseq1d 3962 . . 3 (𝑢 = 𝑎 → (∪ 𝑢 ⊆ 𝑤 ↔ ∪ 𝑎 ⊆ 𝑤))
4845, 47anbi12d 644 . 2 (𝑢 = 𝑎 → (({∅} ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤) ↔ ({∅} ∈ 𝑎 ∧ ∪ 𝑎 ⊆ 𝑤)))
498, 44, 48rexlimddvcbvw 45163 1 (𝜑 → 𝐵 ∈ 𝑤)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  {csn 4584  {cpr 4586  ∪ cuni 4867
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-sn 4585  df-pr 4587  df-uni 4868
This theorem is used by:  mnuprdlem4  45218
  Copyright terms: Public domain W3C validator