Theorem pmtridfv1 33732

Description: Value at X of the transposition of 𝑋 and 𝑌 (understood to be the identity when X = Y ). (Contributed by Thierry Arnoux, 3-Jan-2022.)

Hypotheses

Ref	Expression
pmtridf1o.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
pmtridf1o.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)
pmtridf1o.y	⊢ (𝜑 → 𝑌 ∈ 𝐴)
pmtridf1o.t	⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))

Assertion

Ref	Expression
pmtridfv1	⊢ (𝜑 → (𝑇‘𝑋) = 𝑌)

Proof of Theorem pmtridfv1

Step	Hyp	Ref	Expression
1		pmtridf1o.t	. . . . 5 ⊢ 𝑇 = if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
2		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
3	2	iftrued 4493	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ( I ↾ 𝐴))
4	1, 3	eqtrid 2810	. . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑇 = ( I ↾ 𝐴))
5	4	fveq1d 6913	. . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑋) = (( I ↾ 𝐴)‘𝑋))
6		pmtridf1o.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
7		fvresi 7204	. . . . 5 ⊢ (𝑋 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑋) = 𝑋)
8	6, 7	syl 18	. . . 4 ⊢ (𝜑 → (( I ↾ 𝐴)‘𝑋) = 𝑋)
9	8	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (( I ↾ 𝐴)‘𝑋) = 𝑋)
10	5, 9, 2	3eqtrd 2802	. 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑇‘𝑋) = 𝑌)
11		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
12	11	neneqd 2964	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌)
13	12	iffalsed 4496	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → if(𝑋 = 𝑌, ( I ↾ 𝐴), ((pmTrsp‘𝐴)‘{𝑋, 𝑌})) = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
14	1, 13	eqtrid 2810	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑇 = ((pmTrsp‘𝐴)‘{𝑋, 𝑌}))
15	14	fveq1d 6913	. . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑋) = (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋))
16		pmtridf1o.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
17	16	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐴 ∈ 𝑉)
18	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴)
19		pmtridf1o.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐴)
20	19	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴)
21		eqid 2763	. . . . 5 ⊢ (pmTrsp‘𝐴) = (pmTrsp‘𝐴)
22	21	pmtrprfv 19700	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑋 ≠ 𝑌)) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋) = 𝑌)
23	17, 18, 20, 11, 22	syl13anc 1400	. . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (((pmTrsp‘𝐴)‘{𝑋, 𝑌})‘𝑋) = 𝑌)
24	15, 23	eqtrd 2798	. 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑇‘𝑋) = 𝑌)
25	10, 24	pm2.61dane 3046	1 ⊢ (𝜑 → (𝑇‘𝑋) = 𝑌)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ifcif 4485  {cpr 4590   I cid 5550   ↾ cres 5658  ‘cfv 6561  pmTrspcpmtr 19688

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-1o 8507  df-2o 8508  df-en 9005  df-pmtr 19689

This theorem is used by: (None)