Theorem diaffval 41862

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 3478	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		fveq2 6885	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		diaval.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2818	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6885	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
6		diaval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
7	5, 6	eqtr4di 2818	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
8		fveq2 6885	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
9		diaval.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
10	8, 9	eqtr4di 2818	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
11	10	breqd 5122	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑦(le‘𝑘)𝑤 ↔ 𝑦 ≤ 𝑤))
12	7, 11	rabeqbidv 3436	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} = {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤})
13		fveq2 6885	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
14	13	fveq1d 6887	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
15		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (trL‘𝑘) = (trL‘𝐾))
16	15	fveq1d 6887	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ((trL‘𝑘)‘𝑤) = ((trL‘𝐾)‘𝑤))
17	16	fveq1d 6887	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘𝑓) = (((trL‘𝐾)‘𝑤)‘𝑓))
18		eqidd 2766	. . . . . . 7 ⊢ (𝑘 = 𝐾 → 𝑥 = 𝑥)
19	17, 10, 18	breq123d 5125	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥 ↔ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥))
20	14, 19	rabeqbidv 3436	. . . . 5 ⊢ (𝑘 = 𝐾 → {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥} = {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})
21	12, 20	mpteq12dv 5200	. . . 4 ⊢ (𝑘 = 𝐾 → (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥}) = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))
22	4, 21	mpteq12dv 5200	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥})) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))
23		df-disoa 41861	. . 3 ⊢ DIsoA = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥})))
24	22, 23, 3	mptfvmpt 7233	. 2 ⊢ (𝐾 ∈ V → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))
25	1, 24	syl 18	1 ⊢ (𝐾 ∈ 𝑉 → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  {crab 3418  Vcvv 3457   class class class wbr 5111   ↦ cmpt 5194  ‘cfv 6540  Basecbs 17291  lecple 17339  LHypclh 40816  LTrncltrn 40933  trLctrl 40990  DIsoAcdia 41860

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-disoa 41861

This theorem is used by:  diafval  41863