Theorem diaffval 42196

Description: The partial isomorphism A for a lattice 𝐾. (Contributed by NM, 15-Oct-2013.)

Hypotheses

Ref	Expression
diaval.b	⊢ 𝐵 = (Base‘𝐾)
diaval.l	⊢ ≤ = (le‘𝐾)
diaval.h	⊢ 𝐻 = (LHyp‘𝐾)

Assertion

Ref	Expression
diaffval	⊢ (𝐾 ∈ 𝑉 → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))

Distinct variable groups:   𝑥,𝑤,𝑦, ≤   𝑤,𝐵,𝑥,𝑦   𝑤,𝐻   𝑤,𝑓,𝑥,𝑦,𝐾

Allowed substitution hints:   𝐵(𝑓)   𝐻(𝑥, 𝑦, 𝑓)   ≤ (𝑓)   𝑉(𝑥, 𝑦, 𝑤, 𝑓)

Proof of Theorem diaffval

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3471	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		fveq2 6890	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		diaval.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2813	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6890	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
6		diaval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
7	5, 6	eqtr4di 2813	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
8		fveq2 6890	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9		diaval.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
10	8, 9	eqtr4di 2813	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
11	10	breqd 5113	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑦(le‘𝑘)𝑤 ↔ 𝑦 ≤ 𝑤))
12	7, 11	rabeqbidv 3429	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} = {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤})
13		fveq2 6890	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
14	13	fveq1d 6892	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
15		fveq2 6890	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (trL‘𝑘) = (trL‘𝐾))
16	15	fveq1d 6892	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ((trL‘𝑘)‘𝑤) = ((trL‘𝐾)‘𝑤))
17	16	fveq1d 6892	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘𝑓) = (((trL‘𝐾)‘𝑤)‘𝑓))
18		eqidd 2761	. . . . . . 7 ⊢ (𝑘 = 𝐾 → 𝑥 = 𝑥)
19	17, 10, 18	breq123d 5116	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥 ↔ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥))
20	14, 19	rabeqbidv 3429	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥} = {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})
21	12, 20	mpteq12dv 5191	. . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥}) = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))
22	4, 21	mpteq12dv 5191	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥})) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))
23		df-disoa 42195	. . 3 ⊢ DIsoA = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥})))
24	22, 23, 3	mptfvmpt 7238	. 2 ⊢ (𝐾 ∈ V → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))
25	1, 24	syl 18	1 ⊢ (𝐾 ∈ 𝑉 → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6543  Basecbs 17396  lecple 17444  LHypclh 41150  LTrncltrn 41267  trLctrl 41324  DIsoAcdia 42194

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-disoa 42195

This theorem is used by:  diafval  42197