| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tpfidisj | GIF version | ||
| Description: A triple is finite if it consists of three unequal sets. (Contributed by Jim Kingdon, 1-Oct-2022.) |
| Ref | Expression |
|---|---|
| tpfidisj.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| tpfidisj.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| tpfidisj.c | ⊢ (𝜑 → 𝐶 ∈ 𝑋) |
| tpfidisj.ab | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| tpfidisj.ac | ⊢ (𝜑 → 𝐴 ≠ 𝐶) |
| tpfidisj.bc | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| Ref | Expression |
|---|---|
| tpfidisj | ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-tp 3717 | . 2 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 2 | tpfidisj.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 3 | tpfidisj.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 4 | tpfidisj.ab | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
| 5 | prfidisj 7234 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ∈ Fin) | |
| 6 | 2, 3, 4, 5 | syl3anc 1278 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵} ∈ Fin) |
| 7 | tpfidisj.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑋) | |
| 8 | snfig 7103 | . . . 4 ⊢ (𝐶 ∈ 𝑋 → {𝐶} ∈ Fin) | |
| 9 | 7, 8 | syl 14 | . . 3 ⊢ (𝜑 → {𝐶} ∈ Fin) |
| 10 | tpfidisj.ac | . . . . . 6 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
| 11 | 10 | necomd 2506 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
| 12 | tpfidisj.bc | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
| 13 | 12 | necomd 2506 | . . . . 5 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 14 | 11, 13 | nelprd 3735 | . . . 4 ⊢ (𝜑 → ¬ 𝐶 ∈ {𝐴, 𝐵}) |
| 15 | disjsn 3771 | . . . 4 ⊢ (({𝐴, 𝐵} ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ {𝐴, 𝐵}) | |
| 16 | 14, 15 | sylibr 134 | . . 3 ⊢ (𝜑 → ({𝐴, 𝐵} ∩ {𝐶}) = ∅) |
| 17 | unfidisj 7229 | . . 3 ⊢ (({𝐴, 𝐵} ∈ Fin ∧ {𝐶} ∈ Fin ∧ ({𝐴, 𝐵} ∩ {𝐶}) = ∅) → ({𝐴, 𝐵} ∪ {𝐶}) ∈ Fin) | |
| 18 | 6, 9, 16, 17 | syl3anc 1278 | . 2 ⊢ (𝜑 → ({𝐴, 𝐵} ∪ {𝐶}) ∈ Fin) |
| 19 | 1, 18 | eqeltrid 2325 | 1 ⊢ (𝜑 → {𝐴, 𝐵, 𝐶} ∈ Fin) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∪ cun 3218 ∩ cin 3219 ∅c0 3520 {csn 3709 {cpr 3710 {ctp 3711 Fincfn 7022 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-1o 6687 df-er 6807 df-en 7023 df-fin 7025 |
| This theorem is used by: sumtp 12181 konigsberglem5 16733 |
| Copyright terms: Public domain | W3C validator |