![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fiubm | GIF version |
Description: Lemma for fiubz 10903 and fiubnn 10904. 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 3545 | . . 3 ⊢ (𝐴 = ∅ → ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝐶) | |
3 | brralrspcev 4088 | . . 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 3190 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℚ) |
9 | 8 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ⊆ ℚ) |
10 | fiubm.f | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
11 | 10 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ∈ Fin) |
12 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅) | |
13 | fimaxq 10901 | . . . 4 ⊢ ((𝐴 ⊆ ℚ ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) | |
14 | 9, 11, 12, 13 | syl3anc 1249 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
15 | ssrexv 3245 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) | |
16 | 6, 14, 15 | sylc 62 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
17 | fin0or 6944 | . . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ∃𝑧 𝑧 ∈ 𝐴)) | |
18 | n0r 3461 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝐴 → 𝐴 ≠ ∅) | |
19 | 18 | orim2i 762 | . . 3 ⊢ ((𝐴 = ∅ ∨ ∃𝑧 𝑧 ∈ 𝐴) → (𝐴 = ∅ ∨ 𝐴 ≠ ∅)) |
20 | 10, 17, 19 | 3syl 17 | . 2 ⊢ (𝜑 → (𝐴 = ∅ ∨ 𝐴 ≠ ∅)) |
21 | 4, 16, 20 | mpjaodan 799 | 1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∨ wo 709 = wceq 1364 ∃wex 1503 ∈ wcel 2164 ≠ wne 2364 ∀wral 2472 ∃wrex 2473 ⊆ wss 3154 ∅c0 3447 class class class wbr 4030 Fincfn 6796 ≤ cle 8057 ℚcq 9687 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-po 4328 df-iso 4329 df-iord 4398 df-on 4400 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-er 6589 df-en 6797 df-fin 6799 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-n0 9244 df-z 9321 df-q 9688 df-rp 9723 |
This theorem is referenced by: fiubz 10903 fiubnn 10904 |
Copyright terms: Public domain | W3C validator |