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

Theorem pmtrsn 19042
Description: The value of the transposition generator function for a singleton is empty, i.e. there is no transposition for a singleton. This also holds for 𝐴 ∉ V, i.e. for the empty set {𝐴} = ∅ resulting in (pmTrsp‘∅) = ∅. (Contributed by AV, 6-Aug-2019.)
Assertion
Ref Expression
pmtrsn (pmTrsp‘{𝐴}) = ∅

Proof of Theorem pmtrsn
Dummy variables 𝑝 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snex 5349 . . 3 {𝐴} ∈ V
2 eqid 2738 . . . 4 (pmTrsp‘{𝐴}) = (pmTrsp‘{𝐴})
32pmtrfval 18973 . . 3 ({𝐴} ∈ V → (pmTrsp‘{𝐴}) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))))
41, 3ax-mp 5 . 2 (pmTrsp‘{𝐴}) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)))
5 eqid 2738 . . . . 5 (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)))
65dmmpt 6132 . . . 4 dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = {𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)) ∈ V}
7 2on0 8276 . . . . . . . . 9 2o ≠ ∅
8 ensymb 8743 . . . . . . . . . 10 (∅ ≈ 2o ↔ 2o ≈ ∅)
9 en0 8758 . . . . . . . . . 10 (2o ≈ ∅ ↔ 2o = ∅)
108, 9bitri 274 . . . . . . . . 9 (∅ ≈ 2o ↔ 2o = ∅)
117, 10nemtbir 3039 . . . . . . . 8 ¬ ∅ ≈ 2o
12 snnen2o 8903 . . . . . . . 8 ¬ {𝐴} ≈ 2o
13 0ex 5226 . . . . . . . . 9 ∅ ∈ V
14 breq1 5073 . . . . . . . . . 10 (𝑦 = ∅ → (𝑦 ≈ 2o ↔ ∅ ≈ 2o))
1514notbid 317 . . . . . . . . 9 (𝑦 = ∅ → (¬ 𝑦 ≈ 2o ↔ ¬ ∅ ≈ 2o))
16 breq1 5073 . . . . . . . . . 10 (𝑦 = {𝐴} → (𝑦 ≈ 2o ↔ {𝐴} ≈ 2o))
1716notbid 317 . . . . . . . . 9 (𝑦 = {𝐴} → (¬ 𝑦 ≈ 2o ↔ ¬ {𝐴} ≈ 2o))
1813, 1, 15, 17ralpr 4633 . . . . . . . 8 (∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o ↔ (¬ ∅ ≈ 2o ∧ ¬ {𝐴} ≈ 2o))
1911, 12, 18mpbir2an 707 . . . . . . 7 𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o
20 pwsn 4828 . . . . . . . 8 𝒫 {𝐴} = {∅, {𝐴}}
2120raleqi 3337 . . . . . . 7 (∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o ↔ ∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o)
2219, 21mpbir 230 . . . . . 6 𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o
23 rabeq0 4315 . . . . . 6 ({𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} = ∅ ↔ ∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o)
2422, 23mpbir 230 . . . . 5 {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} = ∅
2524rabeqi 3406 . . . 4 {𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)) ∈ V} = {𝑝 ∈ ∅ ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)) ∈ V}
26 rab0 4313 . . . 4 {𝑝 ∈ ∅ ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)) ∈ V} = ∅
276, 25, 263eqtri 2770 . . 3 dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = ∅
28 mptrel 5724 . . . 4 Rel (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧)))
29 reldm0 5826 . . . 4 (Rel (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) → ((𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = ∅ ↔ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = ∅))
3028, 29ax-mp 5 . . 3 ((𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = ∅ ↔ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = ∅)
3127, 30mpbir 230 . 2 (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧𝑝, (𝑝 ∖ {𝑧}), 𝑧))) = ∅
324, 31eqtri 2766 1 (pmTrsp‘{𝐴}) = ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205   = wceq 1539  wcel 2108  wral 3063  {crab 3067  Vcvv 3422  cdif 3880  c0 4253  ifcif 4456  𝒫 cpw 4530  {csn 4558  {cpr 4560   cuni 4836   class class class wbr 5070  cmpt 5153  dom cdm 5580  Rel wrel 5585  cfv 6418  2oc2o 8261  cen 8688  pmTrspcpmtr 18964
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-1o 8267  df-2o 8268  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pmtr 18965
This theorem is referenced by:  psgnsn  19043
  Copyright terms: Public domain W3C validator