| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qliftrel | GIF version | ||
| Description: 𝐹, a function lift, is a subset of 𝑅 × 𝑆. (Contributed by Mario Carneiro, 23-Dec-2016.) |
| Ref | Expression |
|---|---|
| qlift.1 | ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈[𝑥]𝑅, 𝐴〉) |
| qlift.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑌) |
| qlift.3 | ⊢ (𝜑 → 𝑅 Er 𝑋) |
| qlift.4 | ⊢ (𝜑 → 𝑋 ∈ V) |
| Ref | Expression |
|---|---|
| qliftrel | ⊢ (𝜑 → 𝐹 ⊆ ((𝑋 / 𝑅) × 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qlift.1 | . 2 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈[𝑥]𝑅, 𝐴〉) | |
| 2 | qlift.2 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑌) | |
| 3 | qlift.3 | . . 3 ⊢ (𝜑 → 𝑅 Er 𝑋) | |
| 4 | qlift.4 | . . 3 ⊢ (𝜑 → 𝑋 ∈ V) | |
| 5 | 1, 2, 3, 4 | qliftlem 6849 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅)) |
| 6 | 1, 5, 2 | fliftrel 5967 | 1 ⊢ (𝜑 → 𝐹 ⊆ ((𝑋 / 𝑅) × 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ⊆ wss 3213 〈cop 3694 ↦ cmpt 4173 × cxp 4749 ran crn 4752 Er wer 6766 [cec 6767 / cqs 6768 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3045 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-fv 5362 df-er 6769 df-ec 6771 df-qs 6775 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |