Theorem pmtrsn 19505

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.

Step	Hyp	Ref	Expression
1		snex 5416	. . 3 ⊢ {𝐴} ∈ V
2		eqid 2734	. . . 4 ⊢ (pmTrsp‘{𝐴}) = (pmTrsp‘{𝐴})
3	2	pmtrfval 19436	. . 3 ⊢ ({𝐴} ∈ V → (pmTrsp‘{𝐴}) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
4	1, 3	ax-mp 5	. 2 ⊢ (pmTrsp‘{𝐴}) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
5		eqid 2734	. . . . 5 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
6	5	dmmpt 6240	. . . 4 ⊢ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = {𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V}
7		2on0 8504	. . . . . . . . 9 ⊢ 2o ≠ ∅
8		ensymb 9024	. . . . . . . . . 10 ⊢ (∅ ≈ 2o ↔ 2o ≈ ∅)
9		en0 9040	. . . . . . . . . 10 ⊢ (2o ≈ ∅ ↔ 2o = ∅)
10	8, 9	bitri 275	. . . . . . . . 9 ⊢ (∅ ≈ 2o ↔ 2o = ∅)
11	7, 10	nemtbir 3027	. . . . . . . 8 ⊢ ¬ ∅ ≈ 2o
12		snnen2o 9255	. . . . . . . 8 ⊢ ¬ {𝐴} ≈ 2o
13		0ex 5287	. . . . . . . . 9 ⊢ ∅ ∈ V
14		breq1 5126	. . . . . . . . . 10 ⊢ (𝑦 = ∅ → (𝑦 ≈ 2o ↔ ∅ ≈ 2o))
15	14	notbid 318	. . . . . . . . 9 ⊢ (𝑦 = ∅ → (¬ 𝑦 ≈ 2o ↔ ¬ ∅ ≈ 2o))
16		breq1 5126	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝑦 ≈ 2o ↔ {𝐴} ≈ 2o))
17	16	notbid 318	. . . . . . . . 9 ⊢ (𝑦 = {𝐴} → (¬ 𝑦 ≈ 2o ↔ ¬ {𝐴} ≈ 2o))
18	13, 1, 15, 17	ralpr 4680	. . . . . . . 8 ⊢ (∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o ↔ (¬ ∅ ≈ 2o ∧ ¬ {𝐴} ≈ 2o))
19	11, 12, 18	mpbir2an 711	. . . . . . 7 ⊢ ∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o
20		pwsn 4880	. . . . . . . 8 ⊢ 𝒫 {𝐴} = {∅, {𝐴}}
21	20	raleqi 3307	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o ↔ ∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o)
22	19, 21	mpbir 231	. . . . . 6 ⊢ ∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o
23		rabeq0 4368	. . . . . 6 ⊢ ({𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} = ∅ ↔ ∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o)
24	22, 23	mpbir 231	. . . . 5 ⊢ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} = ∅
25	24	rabeqi 3433	. . . 4 ⊢ {𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V} = {𝑝 ∈ ∅ ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V}
26		rab0 4366	. . . 4 ⊢ {𝑝 ∈ ∅ ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V} = ∅
27	6, 25, 26	3eqtri 2761	. . 3 ⊢ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅
28		mptrel 5815	. . . 4 ⊢ Rel (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
29		reldm0 5918	. . . 4 ⊢ (Rel (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) → ((𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅ ↔ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅))
30	28, 29	ax-mp 5	. . 3 ⊢ ((𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅ ↔ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅)
31	27, 30	mpbir 231	. 2 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅
32	4, 31	eqtri 2757	1 ⊢ (pmTrsp‘{𝐴}) = ∅

Syntax hints:  ¬ wn 3   ↔ wb 206   = wceq 1539   ∈ wcel 2107  ∀wral 3050  {crab 3419  Vcvv 3463   ∖ cdif 3928  ∅c0 4313  ifcif 4505  𝒫 cpw 4580  {csn 4606  {cpr 4608  ∪ cuni 4887   class class class wbr 5123   ↦ cmpt 5205  dom cdm 5665  Rel wrel 5670  ‘cfv 6541  2_oc2o 8482   ≈ cen 8964  pmTrspcpmtr 19427

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5259  ax-sep 5276  ax-nul 5286  ax-pow 5345  ax-pr 5412  ax-un 7737

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-iun 4973  df-br 5124  df-opab 5186  df-mpt 5206  df-id 5558  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-suc 6369  df-iota 6494  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-1o 8488  df-2o 8489  df-er 8727  df-en 8968  df-pmtr 19428

This theorem is referenced by:  psgnsn  19506