Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > clrellem | Structured version Visualization version GIF version |
Description: When the property 𝜓 holds for a relation substituted for 𝑥, then the closure on that property is a relation if the base set is a relation. (Contributed by RP, 30-Jul-2020.) |
Ref | Expression |
---|---|
clrellem.y | ⊢ (𝜑 → 𝑌 ∈ V) |
clrellem.rel | ⊢ (𝜑 → Rel 𝑋) |
clrellem.sub | ⊢ (𝑥 = ◡◡𝑌 → (𝜓 ↔ 𝜒)) |
clrellem.sup | ⊢ (𝜑 → 𝑋 ⊆ 𝑌) |
clrellem.maj | ⊢ (𝜑 → 𝜒) |
Ref | Expression |
---|---|
clrellem | ⊢ (𝜑 → Rel ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clrellem.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ V) | |
2 | cnvexg 7628 | . . . 4 ⊢ (𝑌 ∈ V → ◡𝑌 ∈ V) | |
3 | cnvexg 7628 | . . . 4 ⊢ (◡𝑌 ∈ V → ◡◡𝑌 ∈ V) | |
4 | 1, 2, 3 | 3syl 18 | . . 3 ⊢ (𝜑 → ◡◡𝑌 ∈ V) |
5 | clrellem.rel | . . . . . 6 ⊢ (𝜑 → Rel 𝑋) | |
6 | dfrel2 6045 | . . . . . 6 ⊢ (Rel 𝑋 ↔ ◡◡𝑋 = 𝑋) | |
7 | 5, 6 | sylib 220 | . . . . 5 ⊢ (𝜑 → ◡◡𝑋 = 𝑋) |
8 | clrellem.sup | . . . . . 6 ⊢ (𝜑 → 𝑋 ⊆ 𝑌) | |
9 | cnvss 5742 | . . . . . 6 ⊢ (𝑋 ⊆ 𝑌 → ◡𝑋 ⊆ ◡𝑌) | |
10 | cnvss 5742 | . . . . . 6 ⊢ (◡𝑋 ⊆ ◡𝑌 → ◡◡𝑋 ⊆ ◡◡𝑌) | |
11 | 8, 9, 10 | 3syl 18 | . . . . 5 ⊢ (𝜑 → ◡◡𝑋 ⊆ ◡◡𝑌) |
12 | 7, 11 | eqsstrrd 4005 | . . . 4 ⊢ (𝜑 → 𝑋 ⊆ ◡◡𝑌) |
13 | clrellem.maj | . . . 4 ⊢ (𝜑 → 𝜒) | |
14 | relcnv 5966 | . . . . 5 ⊢ Rel ◡◡𝑌 | |
15 | 14 | a1i 11 | . . . 4 ⊢ (𝜑 → Rel ◡◡𝑌) |
16 | 12, 13, 15 | jca31 517 | . . 3 ⊢ (𝜑 → ((𝑋 ⊆ ◡◡𝑌 ∧ 𝜒) ∧ Rel ◡◡𝑌)) |
17 | clrellem.sub | . . . . 5 ⊢ (𝑥 = ◡◡𝑌 → (𝜓 ↔ 𝜒)) | |
18 | 17 | cleq2lem 39966 | . . . 4 ⊢ (𝑥 = ◡◡𝑌 → ((𝑋 ⊆ 𝑥 ∧ 𝜓) ↔ (𝑋 ⊆ ◡◡𝑌 ∧ 𝜒))) |
19 | releq 5650 | . . . 4 ⊢ (𝑥 = ◡◡𝑌 → (Rel 𝑥 ↔ Rel ◡◡𝑌)) | |
20 | 18, 19 | anbi12d 632 | . . 3 ⊢ (𝑥 = ◡◡𝑌 → (((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥) ↔ ((𝑋 ⊆ ◡◡𝑌 ∧ 𝜒) ∧ Rel ◡◡𝑌))) |
21 | 4, 16, 20 | spcedv 3598 | . 2 ⊢ (𝜑 → ∃𝑥((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥)) |
22 | releq 5650 | . . . 4 ⊢ (𝑦 = 𝑥 → (Rel 𝑦 ↔ Rel 𝑥)) | |
23 | 22 | rexab2 3690 | . . 3 ⊢ (∃𝑦 ∈ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}Rel 𝑦 ↔ ∃𝑥((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥)) |
24 | 23 | biimpri 230 | . 2 ⊢ (∃𝑥((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥) → ∃𝑦 ∈ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}Rel 𝑦) |
25 | relint 5691 | . 2 ⊢ (∃𝑦 ∈ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}Rel 𝑦 → Rel ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}) | |
26 | 21, 24, 25 | 3syl 18 | 1 ⊢ (𝜑 → Rel ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∃wex 1776 ∈ wcel 2110 {cab 2799 ∃wrex 3139 Vcvv 3494 ⊆ wss 3935 ∩ cint 4875 ◡ccnv 5553 Rel wrel 5559 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-int 4876 df-iin 4921 df-br 5066 df-opab 5128 df-xp 5560 df-rel 5561 df-cnv 5562 df-dm 5564 df-rn 5565 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |