| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > disjsuc | Structured version Visualization version GIF version | ||
| Description: Disjoint range Cartesian product, special case. (Contributed by Peter Mazsa, 25-Aug-2023.) |
| Ref | Expression |
|---|---|
| disjsuc | ⊢ (𝐴 ∈ 𝑉 → ( Disj (𝑅 ⋉ (◡ E ↾ suc 𝐴)) ↔ ( Disj (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ ∀𝑢 ∈ 𝐴 ((𝑢 ∩ 𝐴) = ∅ ∨ ([𝑢]𝑅 ∩ [𝐴]𝑅) = ∅)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjsuc2 39314 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑢 ∈ (𝐴 ∪ {𝐴})∀𝑣 ∈ (𝐴 ∪ {𝐴})(𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅) ↔ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅) ∧ ∀𝑢 ∈ 𝐴 ((𝑢 ∩ 𝐴) = ∅ ∨ ([𝑢]𝑅 ∩ [𝐴]𝑅) = ∅)))) | |
| 2 | df-suc 6361 | . . . . . 6 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 3 | 2 | reseq2i 5967 | . . . . 5 ⊢ (◡ E ↾ suc 𝐴) = (◡ E ↾ (𝐴 ∪ {𝐴})) |
| 4 | 3 | xrneq2i 39300 | . . . 4 ⊢ (𝑅 ⋉ (◡ E ↾ suc 𝐴)) = (𝑅 ⋉ (◡ E ↾ (𝐴 ∪ {𝐴}))) |
| 5 | 4 | disjeqi 39735 | . . 3 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ suc 𝐴)) ↔ Disj (𝑅 ⋉ (◡ E ↾ (𝐴 ∪ {𝐴})))) |
| 6 | disjxrnres5 39747 | . . 3 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ (𝐴 ∪ {𝐴}))) ↔ ∀𝑢 ∈ (𝐴 ∪ {𝐴})∀𝑣 ∈ (𝐴 ∪ {𝐴})(𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅)) | |
| 7 | 5, 6 | bitri 278 | . 2 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ suc 𝐴)) ↔ ∀𝑢 ∈ (𝐴 ∪ {𝐴})∀𝑣 ∈ (𝐴 ∪ {𝐴})(𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅)) |
| 8 | disjxrnres5 39747 | . . 3 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ 𝐴)) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅)) | |
| 9 | 8 | anbi1i 636 | . 2 ⊢ (( Disj (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ ∀𝑢 ∈ 𝐴 ((𝑢 ∩ 𝐴) = ∅ ∨ ([𝑢]𝑅 ∩ [𝐴]𝑅) = ∅)) ↔ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅) ∧ ∀𝑢 ∈ 𝐴 ((𝑢 ∩ 𝐴) = ∅ ∨ ([𝑢]𝑅 ∩ [𝐴]𝑅) = ∅))) |
| 10 | 1, 7, 9 | 3bitr4g 317 | 1 ⊢ (𝐴 ∈ 𝑉 → ( Disj (𝑅 ⋉ (◡ E ↾ suc 𝐴)) ↔ ( Disj (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ ∀𝑢 ∈ 𝐴 ((𝑢 ∩ 𝐴) = ∅ ∨ ([𝑢]𝑅 ∩ [𝐴]𝑅) = ∅)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ∪ cun 3897 ∩ cin 3898 ∅c0 4279 {csn 4584 E cep 5550 ◡ccnv 5650 ↾ cres 5653 suc csuc 6357 [cec 8699 ⋉ cxrn 39074 Disj wdisjALTV 39119 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 ax-reg 9570 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-eprel 5551 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fo 6537 df-fv 6539 df-1st 7990 df-2nd 7991 df-ec 8703 df-xrn 39280 df-coss 39401 df-cnvrefrel 39507 df-funALTV 39667 df-disjALTV 39690 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |