Theorem diafval 40988

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‘𝐾)
diaval.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
diaval.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
diaval.i	⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊)

Assertion

Ref	Expression
diafval	⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊} ↦ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥}))

Distinct variable groups:   𝑥,𝑦, ≤   𝑥,𝐵,𝑦   𝑥,𝑓,𝑦,𝐾   𝑥,𝑅   𝑇,𝑓,𝑥   𝑓,𝑊,𝑥,𝑦

Allowed substitution hints:   𝐵(𝑓)   𝑅(𝑦,𝑓)   𝑇(𝑦)   𝐻(𝑥,𝑦,𝑓)   𝐼(𝑥,𝑦,𝑓)   ≤ (𝑓)   𝑉(𝑥,𝑦,𝑓)

Proof of Theorem diafval

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		diaval.i	. . 3 ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊)
2		diaval.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
3		diaval.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
4		diaval.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
5	2, 3, 4	diaffval 40987	. . . 4 ⊢ (𝐾 ∈ 𝑉 → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})))
6	5	fveq1d 6922	. . 3 ⊢ (𝐾 ∈ 𝑉 → ((DIsoA‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))‘𝑊))
7	1, 6	eqtrid 2792	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐼 = ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))‘𝑊))
8		breq2 5170	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑦 ≤ 𝑤 ↔ 𝑦 ≤ 𝑊))
9	8	rabbidv 3451	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} = {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊})
10		fveq2 6920	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((LTrn‘𝐾)‘𝑤) = ((LTrn‘𝐾)‘𝑊))
11		diaval.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
12	10, 11	eqtr4di 2798	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LTrn‘𝐾)‘𝑤) = 𝑇)
13		fveq2 6920	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((trL‘𝐾)‘𝑤) = ((trL‘𝐾)‘𝑊))
14		diaval.r	. . . . . . . 8 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
15	13, 14	eqtr4di 2798	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((trL‘𝐾)‘𝑤) = 𝑅)
16	15	fveq1d 6922	. . . . . 6 ⊢ (𝑤 = 𝑊 → (((trL‘𝐾)‘𝑤)‘𝑓) = (𝑅‘𝑓))
17	16	breq1d 5176	. . . . 5 ⊢ (𝑤 = 𝑊 → ((((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥 ↔ (𝑅‘𝑓) ≤ 𝑥))
18	12, 17	rabeqbidv 3462	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥} = {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥})
19	9, 18	mpteq12dv 5257	. . 3 ⊢ (𝑤 = 𝑊 → (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}) = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊} ↦ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥}))
20		eqid 2740	. . 3 ⊢ (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥})) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))
21	2	fvexi 6934	. . . 4 ⊢ 𝐵 ∈ V
22	21	mptrabex 7262	. . 3 ⊢ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊} ↦ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥}) ∈ V
23	19, 20, 22	fvmpt 7029	. 2 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))‘𝑊) = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊} ↦ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥}))
24	7, 23	sylan9eq 2800	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊} ↦ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥}))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  {crab 3443   class class class wbr 5166   ↦ cmpt 5249  ‘cfv 6573  Basecbs 17258  lecple 17318  LHypclh 39941  LTrncltrn 40058  trLctrl 40115  DIsoAcdia 40985

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-disoa 40986

This theorem is referenced by:  diaval  40989  diafn  40991