![]() |
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 7611 | . . . 4 ⊢ (𝑌 ∈ V → ◡𝑌 ∈ V) | |
3 | cnvexg 7611 | . . . 4 ⊢ (◡𝑌 ∈ V → ◡◡𝑌 ∈ V) | |
4 | 1, 2, 3 | 3syl 18 | . . 3 ⊢ (𝜑 → ◡◡𝑌 ∈ V) |
5 | clrellem.rel | . . . . . 6 ⊢ (𝜑 → Rel 𝑋) | |
6 | dfrel2 6013 | . . . . . 6 ⊢ (Rel 𝑋 ↔ ◡◡𝑋 = 𝑋) | |
7 | 5, 6 | sylib 221 | . . . . 5 ⊢ (𝜑 → ◡◡𝑋 = 𝑋) |
8 | clrellem.sup | . . . . . 6 ⊢ (𝜑 → 𝑋 ⊆ 𝑌) | |
9 | cnvss 5707 | . . . . . 6 ⊢ (𝑋 ⊆ 𝑌 → ◡𝑋 ⊆ ◡𝑌) | |
10 | cnvss 5707 | . . . . . 6 ⊢ (◡𝑋 ⊆ ◡𝑌 → ◡◡𝑋 ⊆ ◡◡𝑌) | |
11 | 8, 9, 10 | 3syl 18 | . . . . 5 ⊢ (𝜑 → ◡◡𝑋 ⊆ ◡◡𝑌) |
12 | 7, 11 | eqsstrrd 3954 | . . . 4 ⊢ (𝜑 → 𝑋 ⊆ ◡◡𝑌) |
13 | clrellem.maj | . . . 4 ⊢ (𝜑 → 𝜒) | |
14 | relcnv 5934 | . . . . 5 ⊢ Rel ◡◡𝑌 | |
15 | 14 | a1i 11 | . . . 4 ⊢ (𝜑 → Rel ◡◡𝑌) |
16 | 12, 13, 15 | jca31 518 | . . 3 ⊢ (𝜑 → ((𝑋 ⊆ ◡◡𝑌 ∧ 𝜒) ∧ Rel ◡◡𝑌)) |
17 | clrellem.sub | . . . . 5 ⊢ (𝑥 = ◡◡𝑌 → (𝜓 ↔ 𝜒)) | |
18 | 17 | cleq2lem 40308 | . . . 4 ⊢ (𝑥 = ◡◡𝑌 → ((𝑋 ⊆ 𝑥 ∧ 𝜓) ↔ (𝑋 ⊆ ◡◡𝑌 ∧ 𝜒))) |
19 | releq 5615 | . . . 4 ⊢ (𝑥 = ◡◡𝑌 → (Rel 𝑥 ↔ Rel ◡◡𝑌)) | |
20 | 18, 19 | anbi12d 633 | . . 3 ⊢ (𝑥 = ◡◡𝑌 → (((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥) ↔ ((𝑋 ⊆ ◡◡𝑌 ∧ 𝜒) ∧ Rel ◡◡𝑌))) |
21 | 4, 16, 20 | spcedv 3547 | . 2 ⊢ (𝜑 → ∃𝑥((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥)) |
22 | releq 5615 | . . . 4 ⊢ (𝑦 = 𝑥 → (Rel 𝑦 ↔ Rel 𝑥)) | |
23 | 22 | rexab2 3639 | . . 3 ⊢ (∃𝑦 ∈ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}Rel 𝑦 ↔ ∃𝑥((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥)) |
24 | 23 | biimpri 231 | . 2 ⊢ (∃𝑥((𝑋 ⊆ 𝑥 ∧ 𝜓) ∧ Rel 𝑥) → ∃𝑦 ∈ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}Rel 𝑦) |
25 | relint 5656 | . 2 ⊢ (∃𝑦 ∈ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}Rel 𝑦 → Rel ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}) | |
26 | 21, 24, 25 | 3syl 18 | 1 ⊢ (𝜑 → Rel ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ 𝜓)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 {cab 2776 ∃wrex 3107 Vcvv 3441 ⊆ wss 3881 ∩ cint 4838 ◡ccnv 5518 Rel wrel 5524 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-int 4839 df-iin 4884 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 df-dm 5529 df-rn 5530 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |