| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > axcaucvglemcl | GIF version | ||
| Description: Lemma for axcaucvg 8119. Mapping to N and R. (Contributed by Jim Kingdon, 10-Jul-2021.) |
| Ref | Expression |
|---|---|
| axcaucvglemcl.n | ⊢ 𝑁 = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} |
| axcaucvglemcl.f | ⊢ (𝜑 → 𝐹:𝑁⟶ℝ) |
| Ref | Expression |
|---|---|
| axcaucvglemcl | ⊢ ((𝜑 ∧ 𝐽 ∈ N) → (℩𝑧 ∈ R (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉) ∈ R) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pitonn 8067 | . . . . . 6 ⊢ (𝐽 ∈ N → 〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}) | |
| 2 | axcaucvglemcl.n | . . . . . 6 ⊢ 𝑁 = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} | |
| 3 | 1, 2 | eleqtrrdi 2325 | . . . . 5 ⊢ (𝐽 ∈ N → 〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉 ∈ 𝑁) |
| 4 | axcaucvglemcl.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝑁⟶ℝ) | |
| 5 | 4 | ffvelcdmda 5782 | . . . . 5 ⊢ ((𝜑 ∧ 〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉 ∈ 𝑁) → (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) ∈ ℝ) |
| 6 | 3, 5 | sylan2 286 | . . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ N) → (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) ∈ ℝ) |
| 7 | elrealeu 8048 | . . . 4 ⊢ ((𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) ∈ ℝ ↔ ∃!𝑧 ∈ R 〈𝑧, 0R〉 = (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉)) | |
| 8 | 6, 7 | sylib 122 | . . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ N) → ∃!𝑧 ∈ R 〈𝑧, 0R〉 = (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉)) |
| 9 | eqcom 2233 | . . . 4 ⊢ (〈𝑧, 0R〉 = (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) ↔ (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉) | |
| 10 | 9 | reubii 2720 | . . 3 ⊢ (∃!𝑧 ∈ R 〈𝑧, 0R〉 = (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) ↔ ∃!𝑧 ∈ R (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉) |
| 11 | 8, 10 | sylib 122 | . 2 ⊢ ((𝜑 ∧ 𝐽 ∈ N) → ∃!𝑧 ∈ R (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉) |
| 12 | riotacl 5986 | . 2 ⊢ (∃!𝑧 ∈ R (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉 → (℩𝑧 ∈ R (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉) ∈ R) | |
| 13 | 11, 12 | syl 14 | 1 ⊢ ((𝜑 ∧ 𝐽 ∈ N) → (℩𝑧 ∈ R (𝐹‘〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉) = 〈𝑧, 0R〉) ∈ R) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 {cab 2217 ∀wral 2510 ∃!wreu 2512 〈cop 3672 ∩ cint 3928 class class class wbr 4088 ⟶wf 5322 ‘cfv 5326 ℩crio 5969 (class class class)co 6017 1oc1o 6574 [cec 6699 Ncnpi 7491 ~Q ceq 7498 <Q cltq 7504 1Pc1p 7511 +P cpp 7512 ~R cer 7515 Rcnr 7516 0Rc0r 7517 ℝcr 8030 1c1 8032 + caddc 8034 |
| 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 |
| 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-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-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-eprel 4386 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-recs 6470 df-irdg 6535 df-1o 6581 df-2o 6582 df-oadd 6585 df-omul 6586 df-er 6701 df-ec 6703 df-qs 6707 df-ni 7523 df-pli 7524 df-mi 7525 df-lti 7526 df-plpq 7563 df-mpq 7564 df-enq 7566 df-nqqs 7567 df-plqqs 7568 df-mqqs 7569 df-1nqqs 7570 df-rq 7571 df-ltnqqs 7572 df-enq0 7643 df-nq0 7644 df-0nq0 7645 df-plq0 7646 df-mq0 7647 df-inp 7685 df-i1p 7686 df-iplp 7687 df-enr 7945 df-nr 7946 df-plr 7947 df-0r 7950 df-1r 7951 df-c 8037 df-1 8039 df-r 8041 df-add 8042 |
| This theorem is referenced by: axcaucvglemf 8115 axcaucvglemval 8116 |
| Copyright terms: Public domain | W3C validator |