| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > axcaucvglemcl | GIF version | ||
| Description: Lemma for axcaucvg 8215. 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 8163 | . . . . . 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 2326 | . . . . 5 ⊢ (𝐽 ∈ N → 〈[〈(〈{𝑙 ∣ 𝑙 <Q [〈𝐽, 1o〉] ~Q }, {𝑢 ∣ [〈𝐽, 1o〉] ~Q <Q 𝑢}〉 +P 1P), 1P〉] ~R , 0R〉 ∈ 𝑁) |
| 4 | axcaucvglemcl.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝑁⟶ℝ) | |
| 5 | 4 | ffvelcdmda 5812 | . . . . 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 8144 | . . . 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 2234 | . . . 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 2731 | . . 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 6019 | . 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 1398 ∈ wcel 2203 {cab 2218 ∀wral 2520 ∃!wreu 2522 〈cop 3692 ∩ cint 3949 class class class wbr 4109 ⟶wf 5348 ‘cfv 5352 ℩crio 6002 (class class class)co 6050 1oc1o 6640 [cec 6765 Ncnpi 7587 ~Q ceq 7594 <Q cltq 7600 1Pc1p 7607 +P cpp 7608 ~R cer 7611 Rcnr 7612 0Rc0r 7613 ℝcr 8126 1c1 8128 + caddc 8130 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-eprel 4410 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-irdg 6601 df-1o 6647 df-2o 6648 df-oadd 6651 df-omul 6652 df-er 6767 df-ec 6769 df-qs 6773 df-ni 7619 df-pli 7620 df-mi 7621 df-lti 7622 df-plpq 7659 df-mpq 7660 df-enq 7662 df-nqqs 7663 df-plqqs 7664 df-mqqs 7665 df-1nqqs 7666 df-rq 7667 df-ltnqqs 7668 df-enq0 7739 df-nq0 7740 df-0nq0 7741 df-plq0 7742 df-mq0 7743 df-inp 7781 df-i1p 7782 df-iplp 7783 df-enr 8041 df-nr 8042 df-plr 8043 df-0r 8046 df-1r 8047 df-c 8133 df-1 8135 df-r 8137 df-add 8138 |
| This theorem is referenced by: axcaucvglemf 8211 axcaucvglemval 8212 |
| Copyright terms: Public domain | W3C validator |