Theorem pmtrsn 19127

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 5354	. . 3 ⊢ {𝐴} ∈ V
2		eqid 2738	. . . 4 ⊢ (pmTrsp‘{𝐴}) = (pmTrsp‘{𝐴})
3	2	pmtrfval 19058	. . 3 ⊢ ({𝐴} ∈ V → (pmTrsp‘{𝐴}) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
4	1, 3	ax-mp 5	. 2 ⊢ (pmTrsp‘{𝐴}) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
5		eqid 2738	. . . . 5 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
6	5	dmmpt 6143	. . . 4 ⊢ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = {𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V}
7		2on0 8313	. . . . . . . . 9 ⊢ 2o ≠ ∅
8		ensymb 8788	. . . . . . . . . 10 ⊢ (∅ ≈ 2o ↔ 2o ≈ ∅)
9		en0 8803	. . . . . . . . . 10 ⊢ (2o ≈ ∅ ↔ 2o = ∅)
10	8, 9	bitri 274	. . . . . . . . 9 ⊢ (∅ ≈ 2o ↔ 2o = ∅)
11	7, 10	nemtbir 3040	. . . . . . . 8 ⊢ ¬ ∅ ≈ 2o
12		snnen2o 9026	. . . . . . . 8 ⊢ ¬ {𝐴} ≈ 2o
13		0ex 5231	. . . . . . . . 9 ⊢ ∅ ∈ V
14		breq1 5077	. . . . . . . . . 10 ⊢ (𝑦 = ∅ → (𝑦 ≈ 2o ↔ ∅ ≈ 2o))
15	14	notbid 318	. . . . . . . . 9 ⊢ (𝑦 = ∅ → (¬ 𝑦 ≈ 2o ↔ ¬ ∅ ≈ 2o))
16		breq1 5077	. . . . . . . . . 10 ⊢ (𝑦 = {𝐴} → (𝑦 ≈ 2o ↔ {𝐴} ≈ 2o))
17	16	notbid 318	. . . . . . . . 9 ⊢ (𝑦 = {𝐴} → (¬ 𝑦 ≈ 2o ↔ ¬ {𝐴} ≈ 2o))
18	13, 1, 15, 17	ralpr 4636	. . . . . . . 8 ⊢ (∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o ↔ (¬ ∅ ≈ 2o ∧ ¬ {𝐴} ≈ 2o))
19	11, 12, 18	mpbir2an 708	. . . . . . 7 ⊢ ∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o
20		pwsn 4831	. . . . . . . 8 ⊢ 𝒫 {𝐴} = {∅, {𝐴}}
21	20	raleqi 3346	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o ↔ ∀𝑦 ∈ {∅, {𝐴}} ¬ 𝑦 ≈ 2o)
22	19, 21	mpbir 230	. . . . . 6 ⊢ ∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o
23		rabeq0 4318	. . . . . 6 ⊢ ({𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} = ∅ ↔ ∀𝑦 ∈ 𝒫 {𝐴} ¬ 𝑦 ≈ 2o)
24	22, 23	mpbir 230	. . . . 5 ⊢ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} = ∅
25	24	rabeqi 3416	. . . 4 ⊢ {𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V} = {𝑝 ∈ ∅ ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V}
26		rab0 4316	. . . 4 ⊢ {𝑝 ∈ ∅ ∣ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) ∈ V} = ∅
27	6, 25, 26	3eqtri 2770	. . 3 ⊢ dom (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅
28		mptrel 5735	. . . 4 ⊢ Rel (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
29		reldm0 5837	. . . 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 230	. 2 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 {𝐴} ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ {𝐴} ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = ∅
32	4, 31	eqtri 2766	1 ⊢ (pmTrsp‘{𝐴}) = ∅

Syntax hints:  ¬ wn 3   ↔ wb 205   = wceq 1539   ∈ wcel 2106  ∀wral 3064  {crab 3068  Vcvv 3432   ∖ cdif 3884  ∅c0 4256  ifcif 4459  𝒫 cpw 4533  {csn 4561  {cpr 4563  ∪ cuni 4839   class class class wbr 5074   ↦ cmpt 5157  dom cdm 5589  Rel wrel 5594  ‘cfv 6433  2_oc2o 8291   ≈ cen 8730  pmTrspcpmtr 19049

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-rep 5209  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-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  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-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-1o 8297  df-2o 8298  df-er 8498  df-en 8734  df-pmtr 19050

This theorem is referenced by:  psgnsn  19128