| 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 39170 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑢 ∈ (𝐴 ∪ {𝐴})∀𝑣 ∈ (𝐴 ∪ {𝐴})(𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅) ↔ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅) ∧ ∀𝑢 ∈ 𝐴 ((𝑢 ∩ 𝐴) = ∅ ∨ ([𝑢]𝑅 ∩ [𝐴]𝑅) = ∅)))) | |
| 2 | df-suc 6367 | . . . . . 6 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 3 | 2 | reseq2i 5973 | . . . . 5 ⊢ (◡ E ↾ suc 𝐴) = (◡ E ↾ (𝐴 ∪ {𝐴})) |
| 4 | 3 | xrneq2i 39156 | . . . 4 ⊢ (𝑅 ⋉ (◡ E ↾ suc 𝐴)) = (𝑅 ⋉ (◡ E ↾ (𝐴 ∪ {𝐴}))) |
| 5 | 4 | disjeqi 39591 | . . 3 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ suc 𝐴)) ↔ Disj (𝑅 ⋉ (◡ E ↾ (𝐴 ∪ {𝐴})))) |
| 6 | disjxrnres5 39603 | . . 3 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ (𝐴 ∪ {𝐴}))) ↔ ∀𝑢 ∈ (𝐴 ∪ {𝐴})∀𝑣 ∈ (𝐴 ∪ {𝐴})(𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅)) | |
| 7 | 5, 6 | bitri 278 | . 2 ⊢ ( Disj (𝑅 ⋉ (◡ E ↾ suc 𝐴)) ↔ ∀𝑢 ∈ (𝐴 ∪ {𝐴})∀𝑣 ∈ (𝐴 ∪ {𝐴})(𝑢 = 𝑣 ∨ ([𝑢](𝑅 ⋉ ◡ E ) ∩ [𝑣](𝑅 ⋉ ◡ E )) = ∅)) |
| 8 | disjxrnres5 39603 | . . 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 3078 ∪ cun 3900 ∩ cin 3901 ∅c0 4282 {csn 4587 E cep 5558 ◡ccnv 5658 ↾ cres 5661 suc csuc 6363 [cec 8698 ⋉ cxrn 38930 Disj wdisjALTV 38975 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7740 ax-reg 9568 |
| 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 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-rmo 3367 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-eprel 5559 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fo 6543 df-fv 6545 df-1st 7990 df-2nd 7991 df-ec 8702 df-xrn 39136 df-coss 39257 df-cnvrefrel 39363 df-funALTV 39523 df-disjALTV 39546 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |