| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fiubm | GIF version | ||
| Description: Lemma for fiubz 11092 and fiubnn 11093. A general form of those theorems. (Contributed by Jim Kingdon, 29-Oct-2024.) |
| Ref | Expression |
|---|---|
| fiubm.a | ⊢ (𝜑 → 𝐴 ⊆ 𝐵) |
| fiubm.b | ⊢ (𝜑 → 𝐵 ⊆ ℚ) |
| fiubm.c | ⊢ (𝜑 → 𝐶 ∈ 𝐵) |
| fiubm.f | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| Ref | Expression |
|---|---|
| fiubm | ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fiubm.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
| 2 | rzal 3592 | . . 3 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝐶) | |
| 3 | brralrspcev 4147 | . . 3 ⊢ ((𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝐶) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 4 | 1, 2, 3 | syl2an 289 | . 2 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 5 | fiubm.a | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝐵) | |
| 6 | 5 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ⊆ 𝐵) |
| 7 | fiubm.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ ℚ) | |
| 8 | 5, 7 | sstrd 3237 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℚ) |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ⊆ ℚ) |
| 10 | fiubm.f | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 11 | 10 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Fin) |
| 12 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅) | |
| 13 | fimaxq 11090 | . . . 4 ⊢ ((𝐴 ⊆ ℚ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
| 14 | 9, 11, 12, 13 | syl3anc 1273 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 15 | ssrexv 3292 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) | |
| 16 | 6, 14, 15 | sylc 62 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| 17 | fin0or 7074 | . . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ∃𝑧 𝑧 ∈ 𝐴)) | |
| 18 | n0r 3508 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝐴 → 𝐴 ≠ ∅) | |
| 19 | 18 | orim2i 768 | . . 3 ⊢ ((𝐴 = ∅ ∨ ∃𝑧 𝑧 ∈ 𝐴) → (𝐴 = ∅ ∨ 𝐴 ≠ ∅)) |
| 20 | 10, 17, 19 | 3syl 17 | . 2 ⊢ (𝜑 → (𝐴 = ∅ ∨ 𝐴 ≠ ∅)) |
| 21 | 4, 16, 20 | mpjaodan 805 | 1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 715 = wceq 1397 ∃wex 1540 ∈ wcel 2202 ≠ wne 2402 ∀wral 2510 ∃wrex 2511 ⊆ wss 3200 ∅c0 3494 class class class wbr 4088 Fincfn 6908 ≤ cle 8214 ℚcq 9852 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-mulrcl 8130 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-precex 8141 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-apti 8146 ax-pre-ltadd 8147 ax-pre-mulgt0 8148 ax-pre-mulext 8149 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-er 6701 df-en 6909 df-fin 6911 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-reap 8754 df-ap 8761 df-div 8852 df-inn 9143 df-n0 9402 df-z 9479 df-q 9853 df-rp 9888 |
| This theorem is referenced by: fiubz 11092 fiubnn 11093 |
| Copyright terms: Public domain | W3C validator |