MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfac5lem3 Structured version   Visualization version   GIF version

Theorem dfac5lem3 9881
Description: Lemma for dfac5 9884. (Contributed by NM, 12-Apr-2004.)
Hypothesis
Ref Expression
dfac5lem.1 𝐴 = {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 𝑢 = ({𝑡} × 𝑡))}
Assertion
Ref Expression
dfac5lem3 (({𝑤} × 𝑤) ∈ 𝐴 ↔ (𝑤 ≠ ∅ ∧ 𝑤))
Distinct variable groups:   𝑤,𝑢,𝑡,   𝑤,𝐴
Allowed substitution hints:   𝐴(𝑢,𝑡,)

Proof of Theorem dfac5lem3
StepHypRef Expression
1 snex 5354 . . . 4 {𝑤} ∈ V
2 vex 3436 . . . 4 𝑤 ∈ V
31, 2xpex 7603 . . 3 ({𝑤} × 𝑤) ∈ V
4 neeq1 3006 . . . 4 (𝑢 = ({𝑤} × 𝑤) → (𝑢 ≠ ∅ ↔ ({𝑤} × 𝑤) ≠ ∅))
5 eqeq1 2742 . . . . 5 (𝑢 = ({𝑤} × 𝑤) → (𝑢 = ({𝑡} × 𝑡) ↔ ({𝑤} × 𝑤) = ({𝑡} × 𝑡)))
65rexbidv 3226 . . . 4 (𝑢 = ({𝑤} × 𝑤) → (∃𝑡 𝑢 = ({𝑡} × 𝑡) ↔ ∃𝑡 ({𝑤} × 𝑤) = ({𝑡} × 𝑡)))
74, 6anbi12d 631 . . 3 (𝑢 = ({𝑤} × 𝑤) → ((𝑢 ≠ ∅ ∧ ∃𝑡 𝑢 = ({𝑡} × 𝑡)) ↔ (({𝑤} × 𝑤) ≠ ∅ ∧ ∃𝑡 ({𝑤} × 𝑤) = ({𝑡} × 𝑡))))
83, 7elab 3609 . 2 (({𝑤} × 𝑤) ∈ {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 𝑢 = ({𝑡} × 𝑡))} ↔ (({𝑤} × 𝑤) ≠ ∅ ∧ ∃𝑡 ({𝑤} × 𝑤) = ({𝑡} × 𝑡)))
9 dfac5lem.1 . . 3 𝐴 = {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 𝑢 = ({𝑡} × 𝑡))}
109eleq2i 2830 . 2 (({𝑤} × 𝑤) ∈ 𝐴 ↔ ({𝑤} × 𝑤) ∈ {𝑢 ∣ (𝑢 ≠ ∅ ∧ ∃𝑡 𝑢 = ({𝑡} × 𝑡))})
11 xpeq2 5610 . . . . . 6 (𝑤 = ∅ → ({𝑤} × 𝑤) = ({𝑤} × ∅))
12 xp0 6061 . . . . . 6 ({𝑤} × ∅) = ∅
1311, 12eqtrdi 2794 . . . . 5 (𝑤 = ∅ → ({𝑤} × 𝑤) = ∅)
14 rneq 5845 . . . . . 6 (({𝑤} × 𝑤) = ∅ → ran ({𝑤} × 𝑤) = ran ∅)
152snnz 4712 . . . . . . 7 {𝑤} ≠ ∅
16 rnxp 6073 . . . . . . 7 ({𝑤} ≠ ∅ → ran ({𝑤} × 𝑤) = 𝑤)
1715, 16ax-mp 5 . . . . . 6 ran ({𝑤} × 𝑤) = 𝑤
18 rn0 5835 . . . . . 6 ran ∅ = ∅
1914, 17, 183eqtr3g 2801 . . . . 5 (({𝑤} × 𝑤) = ∅ → 𝑤 = ∅)
2013, 19impbii 208 . . . 4 (𝑤 = ∅ ↔ ({𝑤} × 𝑤) = ∅)
2120necon3bii 2996 . . 3 (𝑤 ≠ ∅ ↔ ({𝑤} × 𝑤) ≠ ∅)
22 df-rex 3070 . . . 4 (∃𝑡 ({𝑤} × 𝑤) = ({𝑡} × 𝑡) ↔ ∃𝑡(𝑡 ∧ ({𝑤} × 𝑤) = ({𝑡} × 𝑡)))
23 rneq 5845 . . . . . . . . 9 (({𝑤} × 𝑤) = ({𝑡} × 𝑡) → ran ({𝑤} × 𝑤) = ran ({𝑡} × 𝑡))
24 vex 3436 . . . . . . . . . . 11 𝑡 ∈ V
2524snnz 4712 . . . . . . . . . 10 {𝑡} ≠ ∅
26 rnxp 6073 . . . . . . . . . 10 ({𝑡} ≠ ∅ → ran ({𝑡} × 𝑡) = 𝑡)
2725, 26ax-mp 5 . . . . . . . . 9 ran ({𝑡} × 𝑡) = 𝑡
2823, 17, 273eqtr3g 2801 . . . . . . . 8 (({𝑤} × 𝑤) = ({𝑡} × 𝑡) → 𝑤 = 𝑡)
29 sneq 4571 . . . . . . . . . 10 (𝑤 = 𝑡 → {𝑤} = {𝑡})
3029xpeq1d 5618 . . . . . . . . 9 (𝑤 = 𝑡 → ({𝑤} × 𝑤) = ({𝑡} × 𝑤))
31 xpeq2 5610 . . . . . . . . 9 (𝑤 = 𝑡 → ({𝑡} × 𝑤) = ({𝑡} × 𝑡))
3230, 31eqtrd 2778 . . . . . . . 8 (𝑤 = 𝑡 → ({𝑤} × 𝑤) = ({𝑡} × 𝑡))
3328, 32impbii 208 . . . . . . 7 (({𝑤} × 𝑤) = ({𝑡} × 𝑡) ↔ 𝑤 = 𝑡)
34 equcom 2021 . . . . . . 7 (𝑤 = 𝑡𝑡 = 𝑤)
3533, 34bitri 274 . . . . . 6 (({𝑤} × 𝑤) = ({𝑡} × 𝑡) ↔ 𝑡 = 𝑤)
3635anbi1ci 626 . . . . 5 ((𝑡 ∧ ({𝑤} × 𝑤) = ({𝑡} × 𝑡)) ↔ (𝑡 = 𝑤𝑡))
3736exbii 1850 . . . 4 (∃𝑡(𝑡 ∧ ({𝑤} × 𝑤) = ({𝑡} × 𝑡)) ↔ ∃𝑡(𝑡 = 𝑤𝑡))
38 elequ1 2113 . . . . 5 (𝑡 = 𝑤 → (𝑡𝑤))
3938equsexvw 2008 . . . 4 (∃𝑡(𝑡 = 𝑤𝑡) ↔ 𝑤)
4022, 37, 393bitrri 298 . . 3 (𝑤 ↔ ∃𝑡 ({𝑤} × 𝑤) = ({𝑡} × 𝑡))
4121, 40anbi12i 627 . 2 ((𝑤 ≠ ∅ ∧ 𝑤) ↔ (({𝑤} × 𝑤) ≠ ∅ ∧ ∃𝑡 ({𝑤} × 𝑤) = ({𝑡} × 𝑡)))
428, 10, 413bitr4i 303 1 (({𝑤} × 𝑤) ∈ 𝐴 ↔ (𝑤 ≠ ∅ ∧ 𝑤))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1539  wex 1782  wcel 2106  {cab 2715  wne 2943  wrex 3065  c0 4256  {csn 4561   × cxp 5587  ran crn 5590
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600
This theorem is referenced by:  dfac5lem5  9883
  Copyright terms: Public domain W3C validator