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

Theorem mnuprdlem1 44291
Description: Lemma for mnuprd 44295. (Contributed by Rohan Ridenour, 11-Aug-2023.)
Hypotheses
Ref Expression
mnuprdlem1.1 𝐹 = {{∅, {𝐴}}, {{∅}, {𝐵}}}
mnuprdlem1.3 (𝜑𝐴𝑈)
mnuprdlem1.4 (𝜑𝐵𝑈)
mnuprdlem1.8 (𝜑 → ∀𝑖 ∈ {∅, {∅}}∃𝑢𝐹 (𝑖𝑢 𝑢𝑤))
Assertion
Ref Expression
mnuprdlem1 (𝜑𝐴𝑤)
Distinct variable groups:   𝑤,𝑖,𝑢   𝑢,𝐹,𝑖
Allowed substitution hints:   𝜑(𝑤,𝑢,𝑖)   𝐴(𝑤,𝑢,𝑖)   𝐵(𝑤,𝑢,𝑖)   𝑈(𝑤,𝑢,𝑖)   𝐹(𝑤)

Proof of Theorem mnuprdlem1
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 eleq1 2829 . . . . 5 (𝑖 = ∅ → (𝑖𝑢 ↔ ∅ ∈ 𝑢))
21anbi1d 631 . . . 4 (𝑖 = ∅ → ((𝑖𝑢 𝑢𝑤) ↔ (∅ ∈ 𝑢 𝑢𝑤)))
32rexbidv 3179 . . 3 (𝑖 = ∅ → (∃𝑢𝐹 (𝑖𝑢 𝑢𝑤) ↔ ∃𝑢𝐹 (∅ ∈ 𝑢 𝑢𝑤)))
4 mnuprdlem1.8 . . 3 (𝜑 → ∀𝑖 ∈ {∅, {∅}}∃𝑢𝐹 (𝑖𝑢 𝑢𝑤))
5 0ex 5307 . . . . 5 ∅ ∈ V
65prid1 4762 . . . 4 ∅ ∈ {∅, {∅}}
76a1i 11 . . 3 (𝜑 → ∅ ∈ {∅, {∅}})
83, 4, 7rspcdva 3623 . 2 (𝜑 → ∃𝑢𝐹 (∅ ∈ 𝑢 𝑢𝑤))
9 mnuprdlem1.3 . . . 4 (𝜑𝐴𝑈)
109adantr 480 . . 3 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝐴𝑈)
11 simprl 771 . . . . . . 7 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝑎𝐹)
12 simpr 484 . . . . . . . . . 10 ((𝜑 ∧ ∅ ∈ 𝑎) → ∅ ∈ 𝑎)
13 0nep0 5358 . . . . . . . . . . . . 13 ∅ ≠ {∅}
1413a1i 11 . . . . . . . . . . . 12 (𝜑 → ∅ ≠ {∅})
15 mnuprdlem1.4 . . . . . . . . . . . . . 14 (𝜑𝐵𝑈)
1615snn0d 4775 . . . . . . . . . . . . 13 (𝜑 → {𝐵} ≠ ∅)
1716necomd 2996 . . . . . . . . . . . 12 (𝜑 → ∅ ≠ {𝐵})
1814, 17nelprd 4657 . . . . . . . . . . 11 (𝜑 → ¬ ∅ ∈ {{∅}, {𝐵}})
1918adantr 480 . . . . . . . . . 10 ((𝜑 ∧ ∅ ∈ 𝑎) → ¬ ∅ ∈ {{∅}, {𝐵}})
2012, 19elnelneqd 44215 . . . . . . . . 9 ((𝜑 ∧ ∅ ∈ 𝑎) → ¬ 𝑎 = {{∅}, {𝐵}})
2120adantrr 717 . . . . . . . 8 ((𝜑 ∧ (∅ ∈ 𝑎 𝑎𝑤)) → ¬ 𝑎 = {{∅}, {𝐵}})
2221adantrl 716 . . . . . . 7 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → ¬ 𝑎 = {{∅}, {𝐵}})
23 elpri 4649 . . . . . . . . . 10 (𝑎 ∈ {{∅, {𝐴}}, {{∅}, {𝐵}}} → (𝑎 = {∅, {𝐴}} ∨ 𝑎 = {{∅}, {𝐵}}))
24 mnuprdlem1.1 . . . . . . . . . 10 𝐹 = {{∅, {𝐴}}, {{∅}, {𝐵}}}
2523, 24eleq2s 2859 . . . . . . . . 9 (𝑎𝐹 → (𝑎 = {∅, {𝐴}} ∨ 𝑎 = {{∅}, {𝐵}}))
2625orcomd 872 . . . . . . . 8 (𝑎𝐹 → (𝑎 = {{∅}, {𝐵}} ∨ 𝑎 = {∅, {𝐴}}))
2726ord 865 . . . . . . 7 (𝑎𝐹 → (¬ 𝑎 = {{∅}, {𝐵}} → 𝑎 = {∅, {𝐴}}))
2811, 22, 27sylc 65 . . . . . 6 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝑎 = {∅, {𝐴}})
2928unieqd 4920 . . . . 5 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝑎 = {∅, {𝐴}})
30 snex 5436 . . . . . . 7 {𝐴} ∈ V
315, 30unipr 4924 . . . . . 6 {∅, {𝐴}} = (∅ ∪ {𝐴})
32 uncom 4158 . . . . . 6 (∅ ∪ {𝐴}) = ({𝐴} ∪ ∅)
33 un0 4394 . . . . . 6 ({𝐴} ∪ ∅) = {𝐴}
3431, 32, 333eqtri 2769 . . . . 5 {∅, {𝐴}} = {𝐴}
3529, 34eqtrdi 2793 . . . 4 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝑎 = {𝐴})
36 simprrr 782 . . . 4 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝑎𝑤)
3735, 36eqsstrrd 4019 . . 3 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → {𝐴} ⊆ 𝑤)
38 snssg 4783 . . . 4 (𝐴𝑈 → (𝐴𝑤 ↔ {𝐴} ⊆ 𝑤))
3938biimprd 248 . . 3 (𝐴𝑈 → ({𝐴} ⊆ 𝑤𝐴𝑤))
4010, 37, 39sylc 65 . 2 ((𝜑 ∧ (𝑎𝐹 ∧ (∅ ∈ 𝑎 𝑎𝑤))) → 𝐴𝑤)
41 eleq2w 2825 . . 3 (𝑢 = 𝑎 → (∅ ∈ 𝑢 ↔ ∅ ∈ 𝑎))
42 unieq 4918 . . . 4 (𝑢 = 𝑎 𝑢 = 𝑎)
4342sseq1d 4015 . . 3 (𝑢 = 𝑎 → ( 𝑢𝑤 𝑎𝑤))
4441, 43anbi12d 632 . 2 (𝑢 = 𝑎 → ((∅ ∈ 𝑢 𝑢𝑤) ↔ (∅ ∈ 𝑎 𝑎𝑤)))
458, 40, 44rexlimddvcbvw 44219 1 (𝜑𝐴𝑤)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 848   = wceq 1540  wcel 2108  wne 2940  wral 3061  wrex 3070  cun 3949  wss 3951  c0 4333  {csn 4626  {cpr 4628   cuni 4907
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 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-ral 3062  df-rex 3071  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-sn 4627  df-pr 4629  df-uni 4908
This theorem is referenced by:  mnuprdlem4  44294
  Copyright terms: Public domain W3C validator