| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dibvalrel | Structured version Visualization version GIF version | ||
| Description: The value of partial isomorphism B is a relation. (Contributed by NM, 8-Mar-2014.) |
| Ref | Expression |
|---|---|
| dibcl.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dibcl.i | ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| dibvalrel | ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → Rel (𝐼‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relxp 5678 | . . 3 ⊢ Rel ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))}) | |
| 2 | dibcl.h | . . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 3 | eqid 2762 | . . . . . . . 8 ⊢ ((DIsoA‘𝐾)‘𝑊) = ((DIsoA‘𝐾)‘𝑊) | |
| 4 | dibcl.i | . . . . . . . 8 ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) | |
| 5 | 2, 3, 4 | dibdiadm 41957 | . . . . . . 7 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = dom ((DIsoA‘𝐾)‘𝑊)) |
| 6 | 5 | eleq2d 2848 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑋 ∈ dom 𝐼 ↔ 𝑋 ∈ dom ((DIsoA‘𝐾)‘𝑊))) |
| 7 | 6 | biimpa 481 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ dom ((DIsoA‘𝐾)‘𝑊)) |
| 8 | eqid 2762 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 9 | eqid 2762 | . . . . . 6 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 10 | eqid 2762 | . . . . . 6 ⊢ (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾))) = (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾))) | |
| 11 | 8, 2, 9, 10, 3, 4 | dibval 41944 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom ((DIsoA‘𝐾)‘𝑊)) → (𝐼‘𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))})) |
| 12 | 7, 11 | syldan 602 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → (𝐼‘𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))})) |
| 13 | 12 | releqd 5764 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → (Rel (𝐼‘𝑋) ↔ Rel ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × {(ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ ( I ↾ (Base‘𝐾)))}))) |
| 14 | 1, 13 | mpbiri 261 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → Rel (𝐼‘𝑋)) |
| 15 | rel0 5784 | . . . 4 ⊢ Rel ∅ | |
| 16 | ndmfv 6913 | . . . . 5 ⊢ (¬ 𝑋 ∈ dom 𝐼 → (𝐼‘𝑋) = ∅) | |
| 17 | 16 | releqd 5764 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐼 → (Rel (𝐼‘𝑋) ↔ Rel ∅)) |
| 18 | 15, 17 | mpbiri 261 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐼 → Rel (𝐼‘𝑋)) |
| 19 | 18 | adantl 486 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ ¬ 𝑋 ∈ dom 𝐼) → Rel (𝐼‘𝑋)) |
| 20 | 14, 19 | pm2.61dan 824 | 1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → Rel (𝐼‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∅c0 4285 {csn 4588 ↦ cmpt 5191 I cid 5554 × cxp 5658 dom cdm 5660 ↾ cres 5662 Rel wrel 5665 ‘cfv 6536 Basecbs 17275 LHypclh 40786 LTrncltrn 40903 DIsoAcdia 41830 DIsoBcdib 41940 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-dib 41941 |
| This theorem is used by: dibglbN 41968 dib2dim 42045 dih2dimbALTN 42047 |
| Copyright terms: Public domain | W3C validator |